Submission #2780220
Source Code Expand
import heapq n, k = map(int, input().split()) xys = [tuple(int(x) for x in input().split()) for _ in range(n)] heapq.heapify(xys) time = 0 for _ in range(k): time += xys[0][0] heapq.heappushpop(xys, (xys[0][0]+xys[0][1], xys[0][1])) print(time)
Submission Info
Submission Time | |
---|---|
Task | C - Factory |
User | zehnpaard |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 268 Byte |
Status | AC |
Exec Time | 586 ms |
Memory | 16700 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 18 ms | 3060 KB |
sample_02.txt | AC | 85 ms | 3060 KB |
sample_03.txt | AC | 70 ms | 3060 KB |
subtask_1_1.txt | AC | 20 ms | 3060 KB |
subtask_1_10.txt | AC | 248 ms | 8896 KB |
subtask_1_11.txt | AC | 18 ms | 3060 KB |
subtask_1_12.txt | AC | 373 ms | 16596 KB |
subtask_1_13.txt | AC | 18 ms | 3060 KB |
subtask_1_14.txt | AC | 164 ms | 7068 KB |
subtask_1_15.txt | AC | 555 ms | 16700 KB |
subtask_1_16.txt | AC | 72 ms | 3064 KB |
subtask_1_17.txt | AC | 72 ms | 3060 KB |
subtask_1_18.txt | AC | 481 ms | 16616 KB |
subtask_1_2.txt | AC | 201 ms | 4596 KB |
subtask_1_3.txt | AC | 183 ms | 9788 KB |
subtask_1_4.txt | AC | 121 ms | 3188 KB |
subtask_1_5.txt | AC | 360 ms | 16532 KB |
subtask_1_6.txt | AC | 167 ms | 3828 KB |
subtask_1_7.txt | AC | 86 ms | 3060 KB |
subtask_1_8.txt | AC | 586 ms | 16616 KB |
subtask_1_9.txt | AC | 547 ms | 15164 KB |