提出 #7214815

---

ソースコード 拡げる

import heapq

n, m = map(int, input().split())
ab = []
for i in range(n):
    a, b = map(int, input().split())
    if a > m:
        continue
    ab.append((a, b))
ab = sorted(ab, key=lambda a: a[0])
q = []
day = 0
index = 0
total = 0
while day <= m:
    while index < len(ab) and day >= ab[index][0]:
        heapq.heappush(q, - ab[index][1])
        index += 1
    if len(q) > 0:
        total += - q[0]
        heapq.heappop(q)
    day += 1
print(total)

提出情報

ジャッジ結果