python题解
查看原帖
python题解
1102127
fjk2004楼主2024/7/5 16:46

n,m = map(int,input().split()) ans = [] for i in range(n): w = list(map(int,input().split())) ans.append(w) dp=[[0]*(m+1) for _ in range(n+1)] for i in range(n): for j in range(m+1): if j>=int(ans[i][2]): dp[i][j]=max(dp[i-1][j]+int(ans[i][0]),dp[i-1][j-int(ans[i][2])]+int(ans[i][1])) else: dp[i][j] = dp[i - 1][j] + int(ans[i][0]) print((dp[n-1][m])*5)

2024/7/5 16:46
加载中...