朴素版写法： O(N·S·V)
1. 写法同完全背包问题的朴素版
2. 不能用完全背包的优化方式优化多重背包问题 （即f[j] = max(f[j], f[j - v] + w）

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;
int n, m;
int v[N], w[N], s[N];
int f[N][N];

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 ++) //k <= s[i] && k * v[i] <= j;
                f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + w[i] * k);
    cout << f[n][m] << endl;
    return 0;
}