View Code of Problem 133

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int a[100000],b[100000];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,x,flag=0;
        cin>>n>>x;
        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){
                if(x==2*a[i]){
                    if(b[a[i]]>1){
                        flag=1;
                        break;
                    }
                }
                else{
                    flag=1;
                    break;
                
                }
            }
        }
        if(flag==1)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}