View Code of Problem 6

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
        int n,max=0,flag=1;
        cin>>n;
        int a[n+1][2];
        for(int j=1;j<=n;j++){
            cin>>a[j][0]>>a[j][1];
            if(a[j][1]-a[j][0]>max)max=a[j][1]-a[j][0];
        }
        for(int j=1;j<n;j++){
            if(a[j][0]+max>a[j+1][0]){
                flag=0;
                break;
            }
        }
        if(flag)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;

    }
    return 0;
}