View Code of Problem 3686

#include <iostream>
#include <algorithm>
using namespace std;
int t,n,x,a[1000010];
int main(){
	cin>>t;
	while(t--){
		cin>>n>>x;	
		int flag=0,p=0,q=n-1;
		for(int i=0;i<n;i++){
			cin>>a[i];
//			b[a[i]]++;
		}
		sort(a,a+n);
		while(p<q){
			if(a[p]+a[q]==x){
				flag=1;
				break;
			}else if(a[p]+a[q]>x){
				q--;
			}else{
				p++;
			}
		}
		if(flag)
			cout<<"YES"<<endl;
		else
			cout<<"NO"<<endl;
	}
	return 0;
}