背包问题通常可以将二维的动态规划数组压缩为一维数组。
n, x = map(int, input().split())
# 打赢需要消耗的药丸数量、获取的额外经验
cost_award = []
base = 0
for _ in range(n):
lose, win, c = map(int, input().split())
cost_award.append([c, win - lose])
base += lose
# dp[i]: 拥有 i 个药丸的时候,能获取多少额外经验
dp = [0] * (x + 1)
cur = [0] * (x + 1)
# 当只有前 j 个人的时候
for j in range(1, n + 1):
cost = cost_award[j - 1][0]
award = cost_award[j - 1][1]
for i in range(x + 1):
dp[i] = max(award + cur[i - cost], cur[i]) if i >= cost else cur[i]
# 使用 cur 保存最近一次计算结果
dp, cur = cur, dp
res = (cur[-1] + base) * 5
print(res)