Submission #1194582
Source Code Expand
#include<bits/stdc++.h> #define x first #define y second #define y0 hi1 #define y1 hi2 #define ll long long #define mp make_pair #define pb push_back #define sqr(a) (a)*(a) #define ld long double #define all(a) (a).begin(), (a).end() using namespace std; const int inf = 2000000000; int main(){ int n; cin >> n; int a[3 * n]; for(int i = 0; i < 3 * n; i++){ cin >> a[i]; } sort(a, a + 3 * n); ll ans = 0; for(int i = 3 * n - 1; i > n; i -= 2){ ans += a[i - 1]; } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Omelianenko |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 571 Byte |
Status | AC |
Exec Time | 177 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 | 9 ms | 256 KB |
06.txt | AC | 177 ms | 1408 KB |
07.txt | AC | 57 ms | 1408 KB |
08.txt | AC | 125 ms | 1408 KB |
09.txt | AC | 127 ms | 1408 KB |
10.txt | AC | 124 ms | 1408 KB |