Submission #1481225
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<30)
#define INFLL (1LL<<62LL)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int N;
vector<int> A;
cin >> N;
A.resize(3 * N);
rep(i, 3 * N) cin >> A[i];
sort(A.begin(), A.end(), greater<int>());
ll ans = 0;
REP(i, 0, 2 * N) {
if (i % 2) ans += A[i];
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - AtCoder Group Contest |
User |
d2verb |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
690 Byte |
Status |
AC |
Exec Time |
46 ms |
Memory |
1408 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_example_01.txt, 00_example_02.txt |
All |
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 |
AC |
1 ms |
256 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
01.txt |
AC |
1 ms |
256 KB |
02.txt |
AC |
1 ms |
256 KB |
03.txt |
AC |
1 ms |
256 KB |
04.txt |
AC |
1 ms |
256 KB |
05.txt |
AC |
4 ms |
384 KB |
06.txt |
AC |
36 ms |
1408 KB |
07.txt |
AC |
22 ms |
1408 KB |
08.txt |
AC |
46 ms |
1408 KB |
09.txt |
AC |
46 ms |
1408 KB |
10.txt |
AC |
46 ms |
1408 KB |