View Code of Problem 6

#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    int T,n;
    int l[200],r[200];
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        int max=0;
        int flag=1;
        r[0]=l[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&l[i],&r[i]);
            if(r[i]-l[i]>max)
            {
                max=r[i]-l[i];
            }
        }
        for(int i=1;i<n;i++)
        {
            if(l[i+1]-l[i]<max)
                flag=0;
        }
        if(flag==0)printf("NO\n");
        else printf("YES\n");
    }
    return 0;
}