View Code of Problem 6

#include<stdio.h>
void main()
{
	int T;
	int n;
	int i;
	int left[10000];
	int right[10000];
	int flag = 1;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		int max = 0;
		for ( i = 0; i < n; i++)
		{
			scanf("%d %d", &left[i], &right[i]);
			if(right[i] - left[i] > max)
			{
				max = right[i] - left[i];
			}
		}
		for ( i = 0; i < n-1; i++)
		{
			if (left[i] + max > left[i + 1])
			{
				flag = 0;
			}
		}
		if (flag == 1) 
		{
			printf("YES\n");
		}
		if(flag == 0)
		{
			printf("NO\n");
		}
		
	}
}