Find Pair Given Difference

#include<bits/stdc++.h>
using namespace std;

bool binarysearch(int arr[], int n, int x) {
	int l = 0, r = n - 1, mid;
	while (l <= r) {
		mid = l + ((r - l) / 2);
		if (arr[mid] == x) {
			return true;
		}
		else if (arr[mid] < x)
			l = mid + 1;
		else
			r = mid - 1;
	}
	return false;
}
int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n, i, x;
		cin >>  n >> x;
		int arr[n];
		for (i = 0; i < n; i++)
			cin >> arr[i];
		sort(arr, arr + n);
		for (i = 0; i < n; i++) {
			if (binarysearch(arr, n, abs(x - arr[i])))
				break;
		}
		if (i == n)
			cout << -1 << endl;
		else
			cout << 1 << endl;

	}
	return 0;
}