Submission #1194585
Source Code Expand
#include <iostream> #include <string> #include <list> #include <vector> #include <queue> #include <algorithm> #include <climits> #include <cstring> #include <cmath> #define int long long #define uint unsigned long long #define CONTAINS(v,n) (find((v).begin(), (v).end(), (n)) != (v).end()) #define SORT(v) sort((v).begin(), (v).end()) #define RSORT(v) sort((v).rbegin(), (v).rend()) #define ARY_SORT(a, size) sort((a), (a)+(size)) #define MAX(a,b) (((a) > (b)) ? (a) : (b)) #define MIN(a,b) (((a) < (b)) ? (a) : (b)) using namespace std; int a[300000]; signed main() { int N; cin >> N; for (int i = 0; i < N * 3; i++) { cin >> a[i]; } ARY_SORT(a, N * 3); reverse(a, a + N * 3); int sum = 0; for (int i = 0; i < N; i++) { sum += a[i * 2 + 1]; } cout << sum << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | y_kawano |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 827 Byte |
Status | AC |
Exec Time | 131 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 | 2 ms | 384 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 | 131 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | AC | 102 ms | 2560 KB |
09.txt | AC | 102 ms | 2560 KB |
10.txt | AC | 102 ms | 2560 KB |