View Code of Problem 6

#include<iostream>

using namespace std;

int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		int max=0; 
		cin>>n;
		int l[n],r[n];
		for(int i=0;i<n;++i){
			cin>>l[i]>>r[i];
			if(r[i]-l[i]>max){
				max=r[i]-l[i];
			}
		}
		bool flag=true;
		for(int i=0;i<n-1;++i){
			if(max>l[i+1]-l[i]){
				flag=false;
				break;
			}		
		}
		if(flag){
			cout<<"YES";
		}
		else {
			cout<<"NO";
		}
		cout<<endl;
	}
	return 0;
}