Submission #1358092

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
#include<functional>
using namespace std;
int minx = 1e9, maxn = -1e9, n, a[10000];
int main() {
	cin >> n; for (int i = 1; i <= n; i++)cin >> a[i];
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n / 2; i++) {
		int G = a[i] + a[n + 1 - i];
		minx = min(minx, G);
		maxn = max(maxn, G);
	}
	cout << maxn - minx << endl;
	return 0;
}

Submission Info

Judge Result