View Code of Problem 6

#include<stdio.h>

int main()
{
	int T,n;
	int max ;
	int flag;
	int a[100][2];
	while (scanf("%d",&T)!=EOF)
	{
		while (T--)
		{
			scanf("%d", &n);//n个陷阱
			for (int i = 0; i < n; i++)//陷阱的区间
			{
				scanf("%d%d", &a[i][0], &a[i][1]);
			}
			max = 0;
			flag = 1;
			for (int i = 0; i < n; i++) //find max
			{
				if (a[i][1] - a[i][0] > max) max = a[i][1] - a[i][0];
			}
			for (int i = 0; i < n - 1; i++)
			{
				if (a[i][0] + max > a[i + 1][0]) 
				{
					flag = 0;
				}
			}
			if (flag) printf("Yes\n");
			else
			{
				printf("No\n");
			}
		}
	}
	return 0;
}