Submission #8090946

Source Code Expand

import heapq

N, K = map(int, input().split())
machines = []
for i in range(N):
    a, b = map(int, input().split())
    heapq.heappush(machines, (a, b))

res = 0
for i in range(K):
    a, b = heapq.heappop(machines)
    res += a
    heapq.heappush(machines, (a+b, b))

print(res)

Submission Info

Submission Time
Task C - Factory
User nekootoko3
Language Python (3.4.3)
Score 300
Code Size 296 Byte
Status AC
Exec Time 572 ms
Memory 16692 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 21
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 3188 KB
sample_02.txt AC 87 ms 3060 KB
sample_03.txt AC 78 ms 3060 KB
subtask_1_1.txt AC 19 ms 3060 KB
subtask_1_10.txt AC 348 ms 8896 KB
subtask_1_11.txt AC 18 ms 3060 KB
subtask_1_12.txt AC 341 ms 16616 KB
subtask_1_13.txt AC 18 ms 3060 KB
subtask_1_14.txt AC 157 ms 7048 KB
subtask_1_15.txt AC 568 ms 16692 KB
subtask_1_16.txt AC 71 ms 3060 KB
subtask_1_17.txt AC 76 ms 3060 KB
subtask_1_18.txt AC 451 ms 16660 KB
subtask_1_2.txt AC 189 ms 4596 KB
subtask_1_3.txt AC 176 ms 9804 KB
subtask_1_4.txt AC 128 ms 3188 KB
subtask_1_5.txt AC 338 ms 16528 KB
subtask_1_6.txt AC 170 ms 3896 KB
subtask_1_7.txt AC 95 ms 3060 KB
subtask_1_8.txt AC 572 ms 16660 KB
subtask_1_9.txt AC 518 ms 15148 KB