Submission #1194678
Source Code Expand
n = int(raw_input()) a = map(int, raw_input().split()) ans = 0 k = 0 i = 0 a.sort() last = 3*n - 2 ans = 0 while k < n: ans += a[last] last -= 2 k += 1 print ans
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | anuj_shah |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 205 Byte |
Status | AC |
Exec Time | 250 ms |
Memory | 28776 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 | 10 ms | 2568 KB |
00_example_02.txt | AC | 10 ms | 2568 KB |
01.txt | AC | 10 ms | 2568 KB |
02.txt | AC | 10 ms | 2568 KB |
03.txt | AC | 10 ms | 2568 KB |
04.txt | AC | 10 ms | 2568 KB |
05.txt | AC | 22 ms | 3972 KB |
06.txt | AC | 171 ms | 28776 KB |
07.txt | AC | 122 ms | 7348 KB |
08.txt | AC | 250 ms | 24984 KB |
09.txt | AC | 230 ms | 24988 KB |
10.txt | AC | 234 ms | 24988 KB |