View Code of Problem 6

#include <iostream>
#include <cstring>
using namespace std;
int t,n,l[110],r[110];
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=0;i<n;i++)
			cin>>l[i]>>r[i];
		int maxx=0,flag=1;
		for(int i=0;i<n;i++){
			maxx=max(maxx,r[i]-l[i]);
		}
		for(int i=0;i<n-1;i++){
			if(l[i]+maxx>l[i+1]){
				flag=0;
				break;
			}
		}
		if(flag)
			cout<<"YES"<<endl;
		else
			cout<<"NO"<<endl;
		memset(l,0,sizeof(l));
		memset(r,0,sizeof(r));
	}
	return 0;
}