View Code of Problem 6

#include <iostream>
int maxdistance(int num[], int n) {
	int max = 0;
	for (int i = 0; i < n; i++) {
		if (max < num[i]) {
			max = num[i];
		}
	}
	return max;
}
int main()
{
	int T, flag, max;
	std::cin >> T;
	int num[101],save[101][2];
	while (T--) {
		int n;
		flag = 0;
		std::cin >> n;
		for (int i = 0; i < n; i++) {
			int l, r;
			std::cin >> l >> r;
			num[i] = r - l;
			save[i][0] = l;
			save[i][1] = r;
		}
		max = maxdistance(num, n);
		
		for (int i = 1; i < n; i++) {
			if (save[i-1][0] + max > save[i][0]) {
				flag = 1;
				//break;
			}
		}
		if (flag == 1) {
			std::cout << "NO";
		}
		if(flag == 0) {
			std::cout << "YES";
		}
		if (T != 0) {
			std::cout << "\n";
		}

	}
	return 0;
}