A38 - Black Company 1 - 競プロ

A38 - Black Company 1

https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_al

提出

code: python

d, n = map(int, input().split())

lrh = list(map(int, input().split())) for _ in range(n)

# print(lrh)

# 最大値を取っていく

maxd = 24 * d

for i in range(n):

l, r, h = lrhi0, lrhi1, lrhi2

for j in range(l-1, r):

maxdj = min(maxdj, h)

print(sum(maxd))