Submission #1195365

---

Source Code Expand

#include <iostream>
#include <algorithm>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;

int N, a[300000], b[100000][3];

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

  sort(a, a + N * 3);
  reverse(a, a + N * 3);

  // REP(i, 0, N * 3) cout << a[i] << endl;

  REP(i, 0, N) {
    b[i][0] = a[i + N * 2];
    b[i][1] = a[i + N];
    b[i][2] = a[i];
  }

  // REP(i, 0, N) cout << b[i][0] << ", " << b[i][1] << ", " << b[i][2] << endl;

  REP(i, 0, N - 1)
    if(b[i][1] < b[i + 1][2] && b[i][1] >= b[i + 1][1])
      swap(b[i][1], b[i + 1][2]);

  // REP(i, 0, N) cout << b[i][0] << ", " << b[i][1] << ", " << b[i][2] << endl;

  long ans = 0;
  REP(i, 0, N) ans += min(b[i][1], b[i][2]);

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result