Submission #241194
Source Code Expand
N = input() t = [input() for _ in range(N)] ans = sum(t) for b in range(1<<N): s = sum(t[i] for i in range(N) if b>>i&1) ans = min(ans, max(s, sum(t)-s)) print ans
Submission Info
Submission Time | |
---|---|
Task | A - 高橋君とお肉 |
User | kusano |
Language | Python (2.7.3) |
Score | 100 |
Code Size | 179 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 3392 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt |
All | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample-01.txt | AC | 58 ms | 3380 KB |
subtask0-sample-02.txt | AC | 55 ms | 3324 KB |
subtask0-sample-03.txt | AC | 56 ms | 3380 KB |
subtask1-01.txt | AC | 56 ms | 3392 KB |
subtask1-02.txt | AC | 56 ms | 3384 KB |
subtask1-03.txt | AC | 55 ms | 3388 KB |
subtask1-04.txt | AC | 56 ms | 3380 KB |
subtask1-05.txt | AC | 56 ms | 3380 KB |
subtask1-06.txt | AC | 58 ms | 3392 KB |
subtask1-07.txt | AC | 57 ms | 3304 KB |
subtask1-08.txt | AC | 56 ms | 3384 KB |
subtask1-09.txt | AC | 55 ms | 3380 KB |
subtask1-10.txt | AC | 56 ms | 3376 KB |
subtask1-11.txt | AC | 56 ms | 3388 KB |
subtask1-12.txt | AC | 56 ms | 3392 KB |
subtask1-13.txt | AC | 57 ms | 3380 KB |
subtask1-14.txt | AC | 56 ms | 3380 KB |
subtask1-15.txt | AC | 56 ms | 3388 KB |
subtask1-16.txt | AC | 56 ms | 3384 KB |