View Code of Problem 133

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