Submission #5249408

Source Code Expand

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

t = 0
count = 0
while count <K:
    cost, b = heapq.heappop(heap)
    t += cost
    count += 1
 
    heapq.heappush(heap,(cost +b,b))
print(t)

Submission Info

Submission Time
Task C - Factory
User Pondelion1783
Language Python (3.4.3)
Score 300
Code Size 302 Byte
Status AC
Exec Time 579 ms
Memory 16696 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 3060 KB
sample_02.txt AC 97 ms 3060 KB
sample_03.txt AC 77 ms 3060 KB
subtask_1_1.txt AC 20 ms 3060 KB
subtask_1_10.txt AC 365 ms 8896 KB
subtask_1_11.txt AC 18 ms 3060 KB
subtask_1_12.txt AC 341 ms 16628 KB
subtask_1_13.txt AC 19 ms 3060 KB
subtask_1_14.txt AC 164 ms 7068 KB
subtask_1_15.txt AC 579 ms 16696 KB
subtask_1_16.txt AC 87 ms 3060 KB
subtask_1_17.txt AC 85 ms 3060 KB
subtask_1_18.txt AC 458 ms 16656 KB
subtask_1_2.txt AC 204 ms 4596 KB
subtask_1_3.txt AC 171 ms 9788 KB
subtask_1_4.txt AC 145 ms 3188 KB
subtask_1_5.txt AC 351 ms 16532 KB
subtask_1_6.txt AC 183 ms 3948 KB
subtask_1_7.txt AC 100 ms 3060 KB
subtask_1_8.txt AC 554 ms 16664 KB
subtask_1_9.txt AC 514 ms 15164 KB