View Code of Problem 6

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