Submission #1358088

---

Source Code Expand

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int n, a[109];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a, a + n);
	for (int i = 0; i * 2 < n; i++) a[i] += a[n - i - 1];
	cout << *max_element(a, a + n / 2) - *min_element(a, a + n / 2) << endl;
	return 0;
}

Submission Info

Judge Result