显示原始代码
#include <bits/stdc++.h>
#define int long long
using namespace std;
int T;
void solve(int n, int k) {
vector<int> l(n);
vector<int> r(n);
int b[1000000] = { 0 };
for (int i = 0; i < n; i++) {
cin >> l[i] >> r[i];
if (l[i] > k or k > r[i]) {
continue;
}
b[l[i]] += 1;
b[r[i] + 1] -= 1;
}
sort(r.begin(), r.end());
int ans = 0;
int val = -1;
for (int i = 1; i <= r[r.size() - 1]; i++) {
b[i] += b[i - 1];
if (b[i] > val) {
ans = i;
val = b[i];
}
}
if (ans == k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
signed main() {
cin >> T;
while (T--) {
int n, k;
cin >> n >> k;
solve(n, k);
}
return 0;
}