View Code of Problem 6

#include <iostream>
#include <cstdio>
using namespace std;
int main(){
    int T;
    cin>>T;
    while(T--){
        int n;
        cin>>n;
        int a[999],b[999],max = 0,flag = 1;
        for(int i=0;i<n;i++){
            cin>>a[i]>>b[i];
            if(b[i]-a[i]>max)
                max=b[i]-a[i];
        }
        for(int i=0;i<n-1;i++){
            if(a[i+1]-a[i]<max)
                flag =0;
//            cout<<max<<flag<<endl;
        }
        if(flag==0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
    return 0;
}