AC&WA

AC #3 #7 #9 #10

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,x,ans,l[1005],w[1005],u[1005],dp[1005][1005];
signed main()
{
    cin>>n>>x;
    for(int i=1;i<=n;i++)cin>>l[i]>>w[i]>>u[i],l[i]*=5ll,w[i]*=5ll;
    for(int j=1;j<=x;j++)dp[1][j]=j>=u[1]?w[1]:l[1];
    for(int i=2;i<=n;i++)
        for(int j=0;j<=x;j++)
            if(j>=u[i])dp[i][j]=max(dp[i-1][j]+l[i],dp[i-1][j-u[i]]+w[i]),ans=max(ans,dp[i][j]);
            else dp[i][j]=dp[i-1][j]+l[i],ans=max(ans,dp[i][j]);
    cout<<ans;
    return 0;
}