二维
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 110, MAX_V = 110, MAX_S = 110;
int f[MAX_N][MAX_V];
int N, V;
int v[MAX_N][MAX_S], w[MAX_N][MAX_S], cnt[MAX_N];
int main()
{
cin >> N >> V;
for (int i = 1; i <= N; i ++) {
cin >> cnt[i];
for (int j = 0; j < cnt[i]; j ++)
cin >> v[i][j] >> w[i][j];
}
for (int i = 1; i <= N; i ++) {
for (int j = 0; j <= V; j ++) {
f[i][j] = f[i - 1][j];
for(int k = 0; k < cnt[i]; k ++) {
if(j >= v[i][k]) f[i][j] = max(f[i][j], f[i - 1][j - v[i][k]] + w[i][k]);
}
}
}
cout << f[N][V];
return 0;
}
一维
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 110, MAX_V = 110, MAX_S = 110;
int f[MAX_V];
int N, V;
int v[MAX_N][MAX_S], w[MAX_N][MAX_S], cnt[MAX_N];
int main()
{
cin >> N >> V;
for (int i = 1; i <= N; i ++) {
cin >> cnt[i];
for (int j = 0; j < cnt[i]; j ++)
cin >> v[i][j] >> w[i][j];
}
for (int i = 1; i <= N; i ++) {
for (int j = V; j >= 0; j --) {
for(int k = 0; k < cnt[i]; k ++) {
if(j >= v[i][k]) f[j] = max(f[j], f[j - v[i][k]] + w[i][k]);
}
}
}
cout << f[V];
return 0;
}