View Code of Problem 6

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