View Code of Problem 3686

#include<stdio.h>

int cmp(const void *a,const void *b){
	return *(int *)a-*(int *)b;
}

int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n,x,i,j,flag=0;
		scanf("%d %d",&n,&x);
		int a[n];
		for(i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		qsort(a,n,sizeof(a[n]),cmp);
		i=0;j=n-1;
		while(i<j){
			
			if(a[i]+a[j]>x){
				j--;
			}
			else if(a[i]+a[j]<x){
				i++;
			}
			else if(a[i]+a[j]==x){
				flag=1;
				break;
			}
		}
		if(flag==1){
			 printf("YES\n");
		}
		else printf("NO\n");
		flag=0;
	}
}