Submission #1195008

---

Source Code Expand

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
#define sort(v,n) sort(v,v+n)
#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int n;
ll a[400000];
int main() {
	cin >> n;
	for (int i = 0; i < 3*n; i++)cin >> a[i];
	sort(a, 3 * n);
	ll ans = 0;
	for (int i = n;i<=2*n-1; i++) {
		ans += a[i];
	}
	cout << ans << endl;
}

Submission Info

Judge Result