多重背包问题 I

using namespace std;
const int N = 110;
int v[N], w[N], s[N];
int f[N][N];
int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        cin >> v[i] >> w[i] >> s[i];
    }
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= m; j ++)
        {
            for(int k = 0; k <= s[i]; k ++)
            {
                if(j >= k * v[i])f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + k * w[i]);
            }
        }
    }
    int mx = 0;
    cout << f[n][m];
}