View Code of Problem 6

#include <stdio.h>
int Whichismax(int v[], int n)
{
	int i, max;
	max = 0;
	for (i = 0; i<n; i++)
	{
		if (v[i]>v[max])
			max = i;
	}
	return v[max];
}
int main()
{
	int i, mid, t, l, r, n, a[50000], b[50000], v[50000], temp, sum;
	scanf("%d", &t);
 
	while (t--)
	{
		scanf("%d", &n);
		for (i = 0; i < n; i++) {
			scanf("%d%d", &l, &r);
			a[i] = l;
			b[i] = r;
			v[i] = r - l;
		}	
		mid = Whichismax(v, n);
		temp = 1;
          	sum = a[0];
		for (i = 0; i < n-1; i++) {
			sum += mid;
                        if(sum > a[i+1])
                            temp = 0;
                            }
		if (temp == 1) {
			printf("YES\n");
		}
                else{
                  	printf("NO\n");
                }
	}
	return 0;
}