#include<ios
#include<algorithm>
using namespace std;
int main(){
int w[5] = { 0 , 2 , 3 , 4 , 5 };
int v[5] = { 0 , 3 , 4 , 5 , 6 };
int bagV = 8;
int dp[5][9] = { { 0 } };
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]);
}
}
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 9; j++) {
cout << dp[i][j] << ' ';
}
cout << endl;
}
return 0;
}
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w[5] = { 0 , 2 , 3 , 4 , 5 };
int v[5] = { 0 , 3 , 4 , 5 , 6 };
int bagV = 8;
int dp[5][9] = { { 0 } };
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]);
}
}
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 9; j++) {
cout << dp[i][j] << ' ';
}
cout << endl;
}
return 0;
}