Submission #2091047

---

Source Code Expand

#include <iostream>
#include <cstdio>

#include <cstring>
#include <string>

#include <cmath>
#include <algorithm>

#include <vector>
#include <queue>

#include <utility>
#include <map>

// #include <bits/stdc++.h>

#define LL long long
#define vi vector<int>
#define set0(x) memset((x),0,sizeof((x)))
#define set1(x) memset((x),1,sizeof((x)))
#define setmin(x) memset((x),-1,sizeof((x)))
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second

#define MOD 1000000007

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	int n;
	int a[300100];
	LL ans=0;
	cin>>n;
	for(int i=1;i<=3*n;i++) cin>>a[i];
	sort(a+1,a+3*n+1);
	for(int i=3*n-1;i>=n+1;i-=2){
		ans+=a[i];
	}
	cout<<ans<<endl;
	return 0;
}

//1 2 3 4 5 6 7 8 9
//
//1 2 3 4 5 6 7 8 9 10 11 12
//11 9 7 5
//3*3-

Submission Info

Judge Result