Submission #1194563
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <map> #include <unordered_map> #include <set> #include <climits> using namespace std; int N; int a[300000]; int main(){ cin.tie(0); ios::sync_with_stdio(false); cin >> N; for(int i=0; i<3*N; i++) cin >> a[i]; long long ans = 0; sort(a, a+3*N); for(int i=N; i<3*N; i+=2) ans += a[i]; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | suzume |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 474 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 | 45 ms | 1408 KB |
09.txt | AC | 46 ms | 1408 KB |
10.txt | AC | 45 ms | 1408 KB |