View Code of Problem 133

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<climits>
#include<cmath>
#include<map>
#include<set>
#include<queue>

using namespace std;


int main()
{
	int T;
	cin >> T;

	for (int i = 0; i < T; i++) {

		int n, x;
		cin >> n >> x;

		vector<int> nums(n);

		for (int j = 0; j < n; j++)
			cin >> nums[i];

		int flag = 0;
		for (int j = 0; j < n; j++) {

			for (int k = j + 1; k < n; k++) {

				if (nums[j] + nums[k] == x) {

					flag = 1;
					break;
				}
			}
		}

		if (flag == 1)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
}