Submission #73407576

Source Code Expand

import heapq

N, M = map(int, input().split())
F = [0] * N
D = [0] * N
for i in range(N):
    F[i], D[i] = map(int, input().split())

cnt = [0] * N

que = []
for i in range(N):
    heapq.heappush(que, (-F[i], i))

total_cnt = 0
ans = 0
while len(que) > 0 and total_cnt < M:
    f, i = heapq.heappop(que)
    ans -= f
    cnt[i] += 1
    total_cnt += 1
    next_f = max(F[i] - cnt[i]* D[i], 0)
    if next_f > 0:
        heapq.heappush(que, (-next_f, i))

print(ans)

Submission Info

Submission Time
Task D - Orchard Harvest
User ytamu555
Language Python (PyPy 3.11-v7.3.20)
Score 366
Code Size 490 Byte
Status AC
Exec Time 381 ms
Memory 132980 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 366 / 366
Status
AC × 3
AC × 73
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt
Case Name Status Exec Time Memory
in01.txt AC 52 ms 82060 KiB
in02.txt AC 51 ms 82076 KiB
in03.txt AC 51 ms 82108 KiB
in04.txt AC 51 ms 82140 KiB
in05.txt AC 58 ms 95440 KiB
in06.txt AC 51 ms 82140 KiB
in07.txt AC 57 ms 90932 KiB
in08.txt AC 51 ms 82236 KiB
in09.txt AC 374 ms 127880 KiB
in10.txt AC 53 ms 82484 KiB
in11.txt AC 319 ms 127564 KiB
in12.txt AC 244 ms 125864 KiB
in13.txt AC 231 ms 127292 KiB
in14.txt AC 227 ms 127276 KiB
in15.txt AC 289 ms 126452 KiB
in16.txt AC 289 ms 132892 KiB
in17.txt AC 290 ms 132872 KiB
in18.txt AC 288 ms 132872 KiB
in19.txt AC 287 ms 124284 KiB
in20.txt AC 275 ms 132288 KiB
in21.txt AC 323 ms 126768 KiB
in22.txt AC 328 ms 127104 KiB
in23.txt AC 296 ms 132804 KiB
in24.txt AC 336 ms 126088 KiB
in25.txt AC 286 ms 131716 KiB
in26.txt AC 62 ms 97588 KiB
in27.txt AC 73 ms 108524 KiB
in28.txt AC 50 ms 82188 KiB
in29.txt AC 372 ms 126988 KiB
in30.txt AC 52 ms 82268 KiB
in31.txt AC 381 ms 126336 KiB
in32.txt AC 51 ms 82336 KiB
in33.txt AC 50 ms 82140 KiB
in34.txt AC 378 ms 127512 KiB
in35.txt AC 92 ms 108708 KiB
in36.txt AC 51 ms 82280 KiB
in37.txt AC 340 ms 126340 KiB
in38.txt AC 52 ms 82284 KiB
in39.txt AC 59 ms 91484 KiB
in40.txt AC 288 ms 127076 KiB
in41.txt AC 306 ms 132864 KiB
in42.txt AC 330 ms 126340 KiB
in43.txt AC 361 ms 127528 KiB
in44.txt AC 364 ms 127532 KiB
in45.txt AC 372 ms 126992 KiB
in46.txt AC 93 ms 108712 KiB
in47.txt AC 104 ms 108676 KiB
in48.txt AC 207 ms 117796 KiB
in49.txt AC 317 ms 132980 KiB
in50.txt AC 323 ms 126200 KiB
in51.txt AC 326 ms 127608 KiB
in52.txt AC 332 ms 127592 KiB
in53.txt AC 52 ms 82060 KiB
in54.txt AC 51 ms 82336 KiB
in55.txt AC 50 ms 82336 KiB
in56.txt AC 51 ms 82336 KiB
in57.txt AC 59 ms 95768 KiB
in58.txt AC 51 ms 82228 KiB
in59.txt AC 50 ms 81976 KiB
in60.txt AC 50 ms 82108 KiB
in61.txt AC 50 ms 82096 KiB
in62.txt AC 50 ms 82296 KiB
in63.txt AC 51 ms 82060 KiB
in64.txt AC 50 ms 82140 KiB
in65.txt AC 49 ms 82228 KiB
in66.txt AC 288 ms 131720 KiB
in67.txt AC 52 ms 82228 KiB
in68.txt AC 51 ms 82108 KiB
in69.txt AC 283 ms 129668 KiB
in70.txt AC 285 ms 129676 KiB
sample01.txt AC 53 ms 82256 KiB
sample02.txt AC 51 ms 82336 KiB
sample03.txt AC 51 ms 82248 KiB