View Code of Problem 6

#include<iostream>
#include<stdio.h>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
int times;
cin>>times;
while(times--){
    int n;
    int num[101][2];
    int dis[101];
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>num[i][0]>>num[i][1];
        dis[i]=num[i][1]-num[i][0];
    }
    sort(dis,dis+n);
    int cnt=dis[n-1];
    //cout<<cnt;
   int flag=-1;
    for(int j=0;j<n;j++)
    {
        if(num[j][0]+cnt>num[j+1][0])
            {flag=0;
               cout<<"NO"<<endl;break;
            }
    }
    if(flag==-1)
         cout<<"YES"<<endl;
}
return 0;
}