View Code of Problem 6

#include <stdio.h>
int main()
{
	int t;
	int n;
	int l[5000],r[5000],i;
	scanf("%d",&t);
	while(t--)
	{
		int max=0;
		int flag=1;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&l[i],&r[i]);
		}
		for(i=0;i<n;i++)
		{
			if(r[i]-l[i]>max)
			{
				max=r[i]-l[i];
			}
		}
		
		for(i=0;i<n;i++)
		{
			if(r[i]-l[i]<max)
				flag=0;
		}
		if(flag==0)
			printf("NO\n");
		else
			printf("YES\n");
	}
	return 0;
}