View Code of Problem 6

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