完全背包问题

#include<iostream>
#include<vector>
using namespace std;
//完全背包
void test_CompletePack(){
    vector<int> weight = {1, 3, 4};
    vector<int> value = {15, 20, 30};
    int bagWeight = 4;
  //****************代码编写区************//
  //****************代码编写区*************//
    cout<<dp[bagWeight]<<endl;
}
int main(){
    test_CompletePack();
    system("pause");
    return 0;
}

#include<iostream>
#include<vector>
using namespace std;
//完全背包
void test_CompletePack(){
    vector<int> weight = {1, 3, 4};
    vector<int> value = {15, 20, 30};
    int bagWeight = 4;
    vector<int> dp(bagWeight+1,0);
    for(int i=0;i<weight.size();i++){
        for(int j=weight[i];j<=bagWeight;j++){
            dp[j]=max(dp[j],dp[j-weight[i]]+value[i]);
        }
    }
    cout<<dp[bagWeight]<<endl;
}
int main(){
    test_CompletePack();
    system("pause");
    return 0;
}