Submission #464756

#	Time	Username	Problem	Language	Result	Execution time	Memory
464756		Hamed5001	Cipele (COCI18_cipele)	C++14	90 / 90	63 ms	2888 KiB

cipele

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector<int> A1, A2;
int N, M;

bool ok(ll mid) {
	int j = 0;
	for (int i = 0; i < M; i++) {
		if (abs(A2[i] - A1[j]) <= mid)
			j++;
		if (j == N)
			return 1;
	}

	return 0;
}

void solve() {
	cin >> N >> M;
	A1.resize(N); A2.resize(M);
	for (auto& a : A1) cin >> a;
	for (auto& a : A2) cin >> a;
	sort(A1.begin(), A1.end());
	sort(A2.begin(), A2.end());

	if (N > M) {
		swap(N, M);
		swap(A1, A2);
	}

	ll l = 0, r = 1e10, mid;
	while(l < r) {
		mid = (l+r)>>1;
		if (ok(mid)) r = mid;
		else l = mid+1;
	}
	cout << r << endl;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9