Submission #1268148

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268148		MateiKing80	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++20	0 / 100	5090 ms	9532 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
const int inf = 1e9 + 5;


signed main() {
	int n;
	cin >> n;
	vector<int> a(2 * n), b(n), c(n);
	for (int i = 0; i < 2 * n; i ++)
		cin >> a[i];
	for (int i = 0; i < n; i ++)
		cin >> b[i];
	for (int i = 0; i < n; i ++)
		cin >> c[i];
	sort(all(b));
	sort(all(c));
	int ans = inf;
	for (int i = 0; i < n; i ++) {
		vector<int> vb, vc;
		for (int j = 0; j < i; j ++)
			vb.push_back(a[j]);
		for (int j = i; j < i + n; j ++)
			vc.push_back(a[j]);
		for (int j = i + n; j < 2 * n; j ++)
			vb.push_back(a[j]);
		sort(all(vb));
		sort(all(vc));
		int mx = 0;
		for (int j = 0; j < n; j ++) {
			mx = max(mx, abs(vb[j] - b[j]));
			mx = max(mx, abs(vc[j] - c[j]));
		}
		ans = min(ans, mx);
		for (int j = 0; j < n; j ++) {
			mx = max(mx, abs(vc[j] - b[j]));
			mx = max(mx, abs(vb[j] - c[j]));
		}
		ans = min(ans, mx);
	}
	cout << ans << '\n';
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 37
• Subtask 5: 0 / 33