Submission #19071543

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);

signed main() {
	int n; cin >> n;
	vector<int>a(n); for (int i = 0; i < n; i++)cin >> a[i];
	vector<int>b;
	sort(a.begin(), a.end());
	for (int i = 0; i < n / 2; i++) {
		b.push_back(a[n - i - 1] + a[i]);
	}
	sort(b.begin(), b.end());
	cout << b[b.size() - 1] - b[0] << endl;
}

Submission Info

Judge Result