View Code of Problem 6

#include<iostream>
using namespace std;
struct node{
	int l;
	int r;
	int len;
}s[50001];
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>s[i].l>>s[i].r;
			s[i].len=s[i].r-s[i].l;
		}
		for(int i=1;i<n;i++){
			if(s[i].l+s[i-1].len < s[i].r)
			cout<<"NO"<<endl;
			else cout<<"YES"<<endl;
			
		} 
		 
		
		
	}
	
	
	return 0;
}