View Code of Problem 6

#include<iostream>

using namespace std;

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int l[100],r[100],n;
        cin>>n;int maxim=0;
        for(int i=0;i<n;i++)
        {
            cin>>l[i]>>r[i];
            if(maxim<r[i]-l[i])
                maxim=r[i]-l[i];
        }
        int k=0;
        while(true)
        {
            if(n==0)
            {
                cout<<"YES";
                break;
            }
            if(l[k+1]-l[k]<maxim)
            {
                cout<<"NO";
                break;
            }
            k++;
            n--;
        }
        cout<<endl;
    }
}