思路：用二分模板，边界r得包含所有的v，check分为小于，大于，等于三种情况。

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int n;
const int N = 1e4+10;
int a[N],b[N];int check(int v){for(int i=0;i<n;i++){if(a[i]/v>b[i])return 1;if(a[i]/v<b[i])return 2;}return 3;
}
signed main(){cin>>n;for(int i=0;i<n;i++)cin>>a[i]>>b[i];int l=0,r=1e9;while(l<r){int mid = l+r>>1;int ans = check(mid);if(ans==2||ans==3)r=mid;else l=mid+1;}cout<<l<<" ";l=0,r=1e9;while(l<r){int mid = l+r+1>>1;int ans = check(mid);if(ans==1||ans==3)l=mid;else r=mid-1;}cout<<l<<endl;return 0;
}