View Code of Problem 6

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while(t --)
	{
		vector<pair<int,int>> res;
		int n;
		cin >> n;
		int k = 0;
		for(int i = 0;i < n;i ++)
		{
			int a, b;
			cin >> a >> b;
			res.push_back({a,b});
			k = max(k,b-a);
		}
		
		sort(res.begin(),res.end());
		bool flag = true;
		for(int i = 0;i < res.size() - 1;i ++)
		{
			if(res[i+1].first - res[i].first < k)
			{
				flag = false;
				break;
			}
		}
		if(flag) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}