View Code of Problem 133

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int t; cin >> t;
	while (t--) {
		int n, x;
		cin >> n >> x;
		vector<int> arr(n);
		for (int i = 0; i < n; i++)
			cin >> arr[i];
		sort(arr.begin(), arr.end());
		for (int i = 0; i < n - 1; i++) {
			if (binary_search(arr.begin() + i+1, arr.end(), x - arr[i])) {
				cout << "YES\n";
				break;
			}
			if (i == n - 2)cout << "NO\n";
		}
	}
}