Submission #1194014

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;
ll n, a[N], ans;

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>n;
	fo(i,3*n)
		cin>>a[i];
	sort(a+1,a+3*n+1);
	reverse(a+1,a+3*n+1);
	for(int i=2;i<=2*n;i+=2)
		ans+=a[i];
	cout<<ans;
	return 0;	
}

Submission Info

Judge Result