Submission #1194680
Source Code Expand
#include <string> #include <queue> #include <stack> #include <vector> #include <sstream> #include <algorithm> #include <deque> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <list> #include <cstdio> #include <iostream> #include <cmath> #include <climits> #include <bitset> #include <functional> #include <numeric> #include <ctime> #include <cassert> #include <cstring> #include <fstream> #define FOR(i, a, b) for(int (i)=(a); (i)<(b); (i)++) #define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++) #define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--) using namespace std; int main() { int n; cin >> n; vector<long long> a(3 * n); FOR(i, 0, 3 * n) { cin >> a[i]; } sort(a.begin(), a.end()); long long ans = 0; FOR(i, 0, n) { int idx = 3 * n - 2 - 2 * i; ans += a[idx]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | peradfn1126 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 965 Byte |
Status | AC |
Exec Time | 132 ms |
Memory | 2560 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 | 7 ms | 384 KB |
06.txt | AC | 132 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | AC | 103 ms | 2560 KB |
09.txt | AC | 103 ms | 2560 KB |
10.txt | AC | 102 ms | 2560 KB |