Submission #1368922
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 3e5 + 10; int n; ll ans, ans2, ans3, a[N]; int main(){ cin >> n; for(int i = 1; i <= 3 * n; ++ i){ cin >> a[i]; } sort(a + 1, a + n * 3 + 1); for(int i = n + 1; i <= n * 2; ++ i){ ans += a[i]; } for(int i = 2; i <= n * 3; i += 3){ ans2 += a[i]; } for(int i = n * 3 - 1; i > n; i -= 2){ ans3 += a[i]; } cout << max(max(ans, ans2), ans3); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | KtlTheBest |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 481 Byte |
Status | AC |
Exec Time | 131 ms |
Memory | 2688 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 | 131 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | AC | 103 ms | 2688 KB |
09.txt | AC | 103 ms | 2560 KB |
10.txt | AC | 102 ms | 2560 KB |