AcWing 4.多重背包问题 I

与01背包类似j从m开始遍历，

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 2500;

int n,m;
int f[N];

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        int a,b,s;
        cin >> a >> b >> s;
        for (int j = m; j >= 0; j -- )
        {
            for(int k = 1; k <= s && k * a <= j; k ++)
                f[j] = max(f[j],f[j - k * a] + k * b);
        }
    }
    cout << f[m] << endl;
}