View Code of Problem 6

#include<iostream>
using namespace std;
int main()
{
	 int t;
	 cin>>t;
	 while(t--){
	 	int flag=1;
	 	int n;
	 	cin>>n;
	 	int a[200],b[200];
	 	int max=0;
	 	for(int i=0;i<n;i++)
	 	{
	 		cin>>a[i]>>b[i];
	 		if(max<b[i]-a[i]){
	 			max=(b[i]-a[i]);
			 }
		 }
		 for(int i=0;i<n-1;i++){
		 	if(a[i+1]-a[i]<max)
		 	flag=0;
		 }
		 if(flag==0){
		 	cout<<"NO"<<endl;
		 }else{
		 	cout<<"YES"<<endl;
		 }
	 }
	return 0;
}