#include<iostream>
using namespace std;
void KNAPSACK(int s[],int v[],int n,int C)
{
int i,j;
int V[100][100];
for(i=0;i<=n;i++)
V[i][0]=0;
for(j=0;j<=C;j++)
V[0][j]=0;
for(i=1;i<=n;i++)
for(j=1;j<=C;j++)
{
V[i][j]=V[i-1][j];
if(s[i]<=j)
V[i][j]=( V[i][j]<(V[i-1][j-s[i]]+v[i]) )?(V[i-1][j-s[i]]+v[i]):V[i][j];
}
//输出表
for(i=0;i<=n;i++)
{
for(j=0;j<=C;j++)
cout<<V[i][j]<<" ";
cout<<endl;
}
cout<<"最优装载的价值为"<<V[i-1][j-1]<<endl;
}
int main(int argc, char* argv[])
{
int i,j,iNumber,iVo;
cout<<"请输入背包的体积"<<endl;
cin>>iVo;
cout<<"请输入有n项物品"<<endl;
cin>>iNumber;
int *Volume=new int [iNumber];
int *Value=new int [iNumber];
cout<<"请输入这n项物品的体积"<<endl;
for(i=1;i<=iNumber;i++)
cin>>Volume[i];
cout<<"请输入这n项物品的价值"<<endl;
for(j=1;j<=iNumber;j++)
cin>>Value[j];
cout<<endl;
KNAPSACK(Volume,Value,iNumber,iVo);
return 0;
}