需要求出每一个序列的左边界和右边界，让后取出所有的组的左边界和右边的交集即可

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<climits>
using namespace std;
int main(){
	int maxleft=INT_MIN,minright=INT_MAX;
	int t;
	cin>>t;
	while(t--){
		int x,y;
		cin>>x>>y;
		int right=x/y;
		int left=x/(y+1)+1;
		maxleft=max(maxleft,left);
		minright=min(minright,right);
	}
	cout<<maxleft<<" "<<minright;
	return 0;
}