View Code of Problem 6

#include<iostream>
#include<stdlib.h>
#include<stdio.h>

using namespace std;

int main(){
    int t,n,a[50001],b[50001];
    cin>>t;
    while(t--){
    	int i;
        cin>>n;
        for ( i = 0; i < n; i++)
        {
            cin>>a[i]>>b[i];
        }
        int max=0;
        bool flag=true;
        for ( i = 0; i < n; i++)
        {
                if(b[i]-a[i]>max){
                   max=b[i]-a[i];
                    
                }
        }
        for(i=0;i<n-1;i++){
           if(a[i]+max>a[i+1])
             flag=false;
        }
        if(flag) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
        
    }
    return 0;
}