Submission #69313624

---

Source Code Expand

from heapq import heappop, heappush


N, K = map(int, input().split())

h = []
ans = []
rest = K
tp = 0
for _ in range(N):
    a, b, c = map(int, input().split())
    a = max(tp, a)
    while h:
        t, v = h[0]
        if t <= a:
            heappop(h)
            rest += v
        elif rest < c:
            heappop(h)
            rest += v
            a = t
        else:
            break
    rest -= c
    ans.append(a)
    tp = a
    heappush(h, (a + b, c))
print(*ans, sep="\n")

Submission Info

Judge Result