编辑代码

#include <iostream>
using namespace std;
int max(int a,int b)
{
    if(a >= b)
        return a;
    else
        return b;
}
int KnapSack(int C, int n, int w[], int v[])
{
    int V[n+1][C+1];
    for(int i = 0; i <= n; i++)
    {
        V[i][0] = 0;
    }
    for(int j = 0; j <= C; j++)
    {
        V[0][j] = 0;
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= C; j++)
        {
            if(j < w[i])
                V[i][j] = V[i-1][j];
            else
                V[i][j] = max(V[i-1][j], V[i-1][j-w[i]]+v[i]);
        }
    }
    int x[n];
    int j = C;
    cout<<"装入的物品:";
    for(int i = n ; i >= 0; i--)
    {
        if(V[i][j] > V[i-1][j])
        {
            x[i] = 1;
            j = j - w[i];
        }
        else
            x[i] = 0;
        cout<<x[i]<<'\t';
    }
    cout<<endl;
    return V[n][C];
}
int main()
{
    int n;
    int C;
    cout<<"输入物品的个数：\n";
    cin>>n;
    cout<<"输入背包的容量：\n";
    cin>>C;
    int v[n];
    int w[n];
    for(int i = 1 ; i <= 3 ; i++ )
    {
        cout << "输入第" <<i<<"个物品的质量：\n";
        cin >> w[i];
    }
    for(int  i = 1; i <= 3; i++)
    {
        cout << "输入第" <<i<<"个物品的价值：\n";
        cin >> v[i];
    }
    cout << "the max value is ：" << KnapSack(C,n,w,v)<<endl;
}