for (int i = 1 ; i <= 4 ; i++) { // 动态规划

for (int j = 1; j <= bagV; j++) {

if (j < w[i]){

dp[i][j] = dp[i - 1][j];

} else {

dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i]] + v[i]);

}

}

}

if (i >= 0) {

if (dp[i][j] == dp[i - 1][j]) {

item[i] = 0;

findWhat(i - 1, j);

} else if (j - w[i] >= 0 && dp[i][j] == dp[i - 1][j - w[i]] + v[i]) {

item[i] = 1;

findWhat(i - 1, j - w[i]);

}

}

for (int i = 0; i < 5; i++) { //动态规划表输出

for (int j = 0; j < 9; j++) {

cout << dp[i][j] << ' ';

}

cout << endl;

}

for (int i = 0; i < 5; i++) {

cout << item[i] << ' '; // 最优解输出

}

cout << endl;

findMax();

findWhat(4, 8);

print();

return 0;

}