View Code of Problem 6

#include<iostream>
using namespace std;

int main(){
  int T,n,i,max,flag;
  int cap[100][2];
  cin>>T;
  while(T--){
	  cin>>n;
	  for(i=0;i<n;i++){
		  cin>>cap[i][0]>>cap[i][1];
	  }
	  flag = 0;
	  max = 0;
	  for(i=0;i<n-1;i++){
		  if(cap[i][1]-cap[i][0]>max)
			  max = cap[i][1]-cap[i][0];
		  if(cap[i+1][1]-cap[i+1][0]<=max)
			  flag = 1;
	  }
	  if(flag == 1)
		  cout<<"YES"<<endl;
	  else
		  cout<<"NO"<<endl;
  }
}