Submission #385259

#	Time	Username	Problem	Language	Result	Execution time	Memory
385259		penguinhacker	Cipele (COCI18_cipele)	C++14	90 / 90	49 ms	3072 KiB

cipele

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

#define ll long long
#define ar array

int n, m, a[100000], b[100000];

bool ok(int x) {
	int c = 0;
	for (int i = 0, j = 0; i < n; ++i) {
		while(j < m && b[j] + x < a[i])
			++j;
		if (j == m)
			break;
		if (a[i] + x >= b[j])
			++c, ++j;
	}
	return c == min(n, m);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; ++i)
		cin >> a[i];
	for (int i = 0; i < m; ++i)
		cin >> b[i];
	sort(a, a + n);
	sort(b, b + m);
	int l = 0, r = 1e9;
	while(l < r) {
		int mid = (l + r) / 2;
		if (ok(mid))
			r = mid;
		else
			l = mid + 1;
	}
	cout << l;
	return 0;
}

• 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