Submission #69325036

---

Source Code Expand

n, K = map(int, input().split())
ABC = [tuple(map(int, input().split())) for _ in range(n)]
order = sorted(range(n), key=lambda x:ABC[x][0])

import heapq
que = []
tot = 0
t = 0
answer = [0]*n
for i in order:
  a, b, c = ABC[i]
  while tot+c>K:
    t, num = heapq.heappop(que)
    tot -= num
  t = max(t, a)
  answer[i] = t
  heapq.heappush(que, (t+b, c))
  tot += c

print(*answer, sep='\n')

    

Submission Info

Judge Result