Submission #2836980
Source Code Expand
from collections import deque N = int(input()) A = list(map(int, input().split())) A.sort() B = deque(A) ans = 0 for _ in range(N): B.pop() B.popleft() ans += B.pop() print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Ikok |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 209 Byte |
Status | AC |
Exec Time | 242 ms |
Memory | 37468 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 | 20 ms | 3316 KB |
00_example_02.txt | AC | 21 ms | 3316 KB |
01.txt | AC | 20 ms | 3316 KB |
02.txt | AC | 20 ms | 3316 KB |
03.txt | AC | 20 ms | 3316 KB |
04.txt | AC | 20 ms | 3316 KB |
05.txt | AC | 32 ms | 5236 KB |
06.txt | AC | 133 ms | 37468 KB |
07.txt | AC | 104 ms | 8844 KB |
08.txt | AC | 241 ms | 32612 KB |
09.txt | AC | 242 ms | 32404 KB |
10.txt | AC | 241 ms | 32412 KB |