Submission #5169549


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1000000007
typedef pair<int, int> P;

bool prime(int n) {
	for (int i = 2; i <= sqrt(n); i++) {
		if (n % i == 0)return false;
	}
	return n != 1;
}
int gcd(int x, int y) {
	if (y == 0)return x;
	return gcd(y, x % y);
}
int lcm(int x, int y) {
	return x / gcd(x, y) * y;
}

signed main() {
	int n, a[400000], ans = 0;
	cin >> n;
	rep(i, 3 * n) cin >> a[i];
	sort(a, a + 3 * n);
	reverse(a, a + 3 * n);
	for (int i = 1; i < 2 * n; i += 2) {
		ans += a[i];
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Submission Time
Task A - AtCoder Group Contest
User boutarou
Language C++14 (GCC 5.4.1)
Score 300
Code Size 645 Byte
Status
Exec Time 131 ms
Memory 2944 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 300 / 300 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt
Case Name Status Exec Time Memory
00_example_01.txt 1 ms 256 KB
00_example_02.txt 1 ms 256 KB
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 7 ms 384 KB
06.txt 131 ms 2560 KB
07.txt 51 ms 2560 KB
08.txt 102 ms 2560 KB
09.txt 102 ms 2816 KB
10.txt 102 ms 2944 KB