编辑代码

#include <iostream>
using namespace std;

#define N 4   
int w[N];   
int v[N];   
int x[N];    
int n,c;      

int SumWeight = 0; 
int SumValue = 0; 

int OptimalValue = 0;  
int OptimalSolution[N];      


void backtracking(int t)
{
   
    if(t>n)
    {
       
        if(SumValue>OptimalValue)
        {
         
            OptimalValue = SumValue;
            for(int i=1; i<=n; ++i)
                OptimalSolution[i] = x[i];
        }
    }
    else
    {
     
        for(int i=0; i<=1; ++i)
        {
            x[t]=i;

            if(i==0) 
            {
                backtrack(t+1);
            }
            else 
            {
             
                if((SumWeight+w[t])<=c)
                {
                    SumWeight += w[t];
                    SumValue += v[t];
                    backtrack(t+1);
                    SumWeight -= w[t];
                    SumValue -= v[t];
                }
            }
        }
    }
}

int main()
{

    cout<<"请输入物品的个数："<<endl;
    cin>>n;
    cout<<"请输入每个物品的重量及价值(如5 4):"<<endl;
    for(int i = 1; i <= n; i++)
    {
        cin>>w[i]>>v[i];
    }
    cout<<"请输入背包的限制容量："<<endl;
    cin>>c;

    backtrack(1);

    cout<<"最优价值是:"<<OptimalValue<<endl;
    cout<<"(";
    for(int i=1;i<=n;i++)
        cout<<OptimalSolution[i]<<" ";
    cout<<")";
    return 0;
}