Submission #806160
Source Code Expand
Copy
#!/usr/bin/env python3def f(xs, ys):acc = 0for x, y in zip(xs, ys):acc += min(x, y)return accn = int(input())l = sorted(map(int,input().split()))ans = max(f(l[0::2], l[1::2]), f(l[1::2], l[2::2]))print(ans)
#!/usr/bin/env python3 def f(xs, ys): acc = 0 for x, y in zip(xs, ys): acc += min(x, y) return acc n = int(input()) l = sorted(map(int,input().split())) ans = max(f(l[0::2], l[1::2]), f(l[1::2], l[2::2])) print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - BBQ Easy |
User | kimiyuki |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 246 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt |
All | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 36 ms | 3064 KB |
01-02.txt | AC | 36 ms | 3064 KB |
01-03.txt | AC | 37 ms | 3064 KB |
01-04.txt | AC | 36 ms | 3064 KB |
01-05.txt | AC | 36 ms | 3064 KB |
01-06.txt | AC | 37 ms | 3064 KB |
01-07.txt | AC | 38 ms | 3064 KB |
01-08.txt | AC | 36 ms | 3064 KB |
sample-01.txt | AC | 37 ms | 3064 KB |
sample-02.txt | AC | 40 ms | 3064 KB |