WA on test 4求助

#include<iostream>
#include<algorithm>
#include<set>
#define int long long
using namespace std;
int a[114514], b[114514];
int n, k, p,mid;
bool key[114514];
bool cmp(int a, int b) { return abs(p-a) < abs(p-b); }
int find(int num) {
	int l = 1, r = k;
	while (l < r) {
		int m = (l + r) >> 1;
		if (p-(2 *b[m] - a[num]) <= mid||key[num])r = m;
		else l = m+1;
	}
	return l;
}
bool check() {
	for (int i = n; i >=1; i--) {
		int ky=find(a[i]);
		key[ky] = 1;
		if (abs(p - (2 * b[ky] - a[i]))>mid||ky==k) {
			return 0;
		}
	}
	return 1;
}
signed main() {
	
	cin >> n >> k >> p;
	for (int i = 1; i <= n; i++)cin >> a[i];
	for (int i = 1; i <= k; i++)cin >> b[i];
	sort(a + 1, a + 1 + n,cmp);
	sort(b + 1, b + 1 + k,cmp);
	int l = 1, r = 1e18;
	while (l < r) {
		mid = (l + r) >> 1;
		memset(key, 0, sizeof(key));
		if (!check()) {
			l = mid + 1;
		}
		else r = mid;
	}
	cout << l;
}
/*
3 10 1500
106 160 129
1333 1532 1181 1091 1656 1698 1291 1741 1242 1163

*/