Submission #1194622

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

vector<ll> a;

int main() {
    ll n;
    cin >> n;
    REP(i, 3*n) {
        int t;
        cin >> t;
        a.push_back(t);
    }

    sort(a.begin(),a.end(),greater<int>());

    ll ans = 0;
    for (int i = 1; i < 2 * n; i+=2) {
        ans += a[i];
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result