分组背包实际上可以看作是限制了的多重背包
每组只能取一个 那就枚举所有的策略
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
int s[N], v[N], w[N];
int n, m;
int dp[N];
int main() {
cin >> n >> m;
int s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s; j++)cin >> v[j] >> w[j];
for (int j = m; j >= 0; j--) {
for (int k = 0; k < s; k++) {
if (j >= v[k])dp[j] = max(dp[j], dp[j - v[k]] + w[k]);
}
}
}
cout << dp[m] << endl;
return 0;
}