Submission #1747587

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N, A[100];

int main(void) {
  cin >> N;
  REP(i, 0, N) cin >> A[i];

  sort(A, A + N);

  ll mi = (1LL << 60), mx = 0;
  REP(i, 0, N / 2) {
    mi = min(mi, A[i] + A[N - i - 1]);
    mx = max(mx, A[i] + A[N - i - 1]);
  }
  cout << mx - mi << endl;
}

Submission Info

Judge Result