View Code of Problem 6

#include <stdio.h>
int main(){
	int T,n,max,sum,flag;	
	int l[1000],r[1000];
	scanf("%d",&T);
	while(T--){
		max=0;
		flag=1;
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%d %d",&l[i],&r[i]);
			if(max<(r[i]-l[i])){
				max=r[i]-l[i];
			}
		}
		int sum=l[0];
		for(int i=0;i<n-1;i++){
			sum+=max;
			if(sum>l[i+1]){
				flag=0;
				break;
			}							
		} 
		if(flag==1){
			printf("YES\n");
		}
		else
			printf("NO\n");
	}
	return 0;
}