每日打卡 8

#include<iostream>
using namespace std;
#include<algorithm>

int get(int a, int b)
{
    int l = 1, r = 1e9 + 1;
    while (l < r)
    {
        int mid = l + r >> 1;
        if (a / mid <= b) r = mid;
        else l = mid + 1;
    }
    return r;
}
int main()
{
    int n;
    cin >> n;
    int a, b;
    int v_min = 1, v_max = 1e9;
    while (n--)
    {
        cin >> a >> b;
        v_min = max(v_min, get(a, b));
        v_max = min(v_max, get(a, b - 1) - 1);
    }
    cout << v_min << " " << v_max << endl;
}