01 backpack, dynamic planning

#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=10;
const int MAXW=100;
int w[MAXW];    // Weight of goods 
int v[MAXN];    // Value of goods 
int dp[MAXN][MAXW];
int n,c;    // The quantity and value of the goods 
void traceback();
void detail();
int main()
{
    
    cin>>n>>c;
    cout<<" Enter the weight and value of the goods "<<endl;
    for(int i=1;i<=n;i++)    cin>>w[i]>>v[i];

    for(int i=1;i<=n;i++)
    {
    
        for(int j=0;j<=c;j++)
        {
    
            if(w[i]>j)
                dp[i][j]=dp[i-1][j];
            else
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i]);
        }
    }
    cout<<dp[n][c]<<endl;
    traceback();
    detail();
}
void detail()
{
    
    for(int i=1;i<=n;i++)
    {
    
        for(int j=0;j<=c;j++)
            cout<<dp[i][j]<<" ";
        cout<<endl;
    }
}
void traceback()
{
    
    int x[MAXN];
    int temp=c;
    for(int i=n;i>=1;i--)
    {
    
        if(dp[i][temp]==dp[i-1][temp])
            x[i]=0;
        else
        {
    
            x[i]=1;
            temp-=w[i];
        }
    }
    for(int i=1;i<=n;i++)
        if(x[i])
            cout<<i<<" ";
    cout<<endl;
}
/*  The test case ： 1 10 2 12 3 13 3 15 4 15 5 16 */