View Code of Problem 6

#include <stdio.h>
int main()
{
	int T, n, l, r, i, j,k,a[1000],b[1000],N,max,min;
	scanf("%d", &T);
	for (k = 1; k <= T; k++)
	{
		scanf("%d", &n);
		for (j = 0; j < n; j++)
		{
			scanf("%d %d", &a[j], &b[j]);
		}
		min = a[0]; max = b[0];
		for (i = 0; i < n; i++)
		{
			if (a[i] < min)min = a[i];
			if (b[i] > max)max = b[i];
		}
		for (i = min + 1; i < max; i++)
			for (j = 0; j < n;j++)
				if (i>a[j] && i < b[j])
				{
			printf("NO\n"); break;
				}
		if (j == n)printf("YES\n");
	}
}