Submission #1845423

---

Source Code Expand

#include <cstdio>
#include <algorithm>

typedef long long ll;
inline int Get() {
	char ch;
	while ((ch = getchar()) < '0' || ch > '9');
	int Num = ch - '0';
	while ((ch = getchar()) >= '0' && ch <= '9')
		Num = (Num << 3) + (Num << 1) + ch - '0';
	return Num;
}
const int N = 1e5 + 5;
int n, a[N * 3];
int main() {
	n = Get();
	for (int i = 1; i <= n * 3; ++i) a[i] = Get();
	std :: sort(a + 1, a + n * 3 + 1);
	
	ll ans = 0;
	for (int i = 1; i <= n; ++i) ans += a[n + i * 2 - 1];
	printf("%lld\n", ans);
}

Submission Info

Judge Result