最朴素的做法，数据一多就会超时

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
int v[N], w[N], s[N], f[N][N];
int n,m;
int main()
{
    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 = 0; j <= m; j ++)
    {
        for(int k = 0; k <= s[i] && k * v[i] <= j; k ++)
        {
            f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + k * w[i]);
        }
    }
    cout << f[n][m] << endl;
    return 0;
}