Submission #1368895

---

Source Code Expand

/*
ID: 5ak0
PROG:
LANG: C++11
*/

#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7, MAXN = 1e5 * 3 + 10;

int n, a[MAXN];
ll ans;

int main(){
    #ifndef SAKO
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    #endif // SAKO
    ios_base::sync_with_stdio(0);

    cin >> n;
    for (int i = 1; i <= 3 * n; ++i)
        cin >> a[i];
    sort (a + 1, a + (3 * n) + 1);
    reverse (a + 1, a + (3 * n) + 1);
    for (int i = 2; i <= n * 2; i += 2)
        ans += a[i];
    cout << ans;
    return 0;
}

Submission Info

Judge Result