View Code of Problem 3686

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int a[5000000],b[5000000];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,x;
        cin>>n>>x;
        int flag=0;
        memset(b,0,sizeof(b));
        for(int i=0;i<n;i++){
            cin>>a[i];
            b[a[i]]++;
        }
        for(int i=0;i<n;i++){
            if(b[x-a[i]]!=0&&x!=2*a[i]){
                flag=1;
                break;
            }
            else if(b[x-a[i]]>1){
                flag=1;
                break;
            }
        }
        if(flag==1)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}