分组背包模板

链接: link

#include <bits/stdc++.h>

using  namespace std;

const int N = 1e3 + 9;

int n, m, v[N][N], w[N][N], s[N];

int f[N];

signed main() {
    ios::sync_with_stdio(false);

    cin >> n >> m;

    for(int i = 1; i <= n; i++) {
        cin >> s[i];
        for(int j = 0; j < s[i]; j++) {
            cin >> v[i][j] >> w[i][j];
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int j = m; j > 0; j--) {
            for(int k = 0; k < s[i]; k++) {
                if(v[i][k] <= j)
                    f[j] = max(f[j], f[j - v[i][k]] + w[i][k]);
            }
        }
    }

    cout << f[m];

    return 0;
}