Function main

CodeChef_problems/CSUM/solution.cpp:19–40

}

int main() {
	int t, n;
	long long int k, input; // define reusable variable
	string answer = "";
	cin >> t; // input test case
	for (int i=1; i<=t; i++) {
	    cin >> n >> k;
	    vector<long long int> A;
	    for (int j=0; j<n; j++) {
	        cin >> input;
			// limit unnecesary input
			// constrain input > = 1 and ignore if input > k
	        if (0 < input && input < k) {
	            A.push_back(input);
	        }
	    }
		// sort vector ASC for knowing lower and highest boundary
	    sort(A.begin(), A.end());
	    answer = isPaired(A, A.size(), k) ? "Yes" : "No";
	    cout << answer << endl;
	}
}