0-1背包问题

#include <iostream>
using namespace std;
 
typedef struct mine{
     int weight;             //物品的重量
     int price;              //物品的价值
} mine;
 
int main()
{
    int num,container;
    mine data[25];
    cin>>num>>container;
    while(true)
    {
        if(num==0&&container==0)
        break;
        for(int i = 0;i < num; i++)
            cin>>data[i].weight;
        for(i = 0;i < num; i++)                                                 
            cin>>data[i].price;

        for(int m = 0;m < num-1; m++)                               //将物品按价值排序
            for(int n = 0;n < num-m-1; n++)
                if(data[n].price<data[n+1].price)
                {
                    mine temp;
                    temp.price = data[n].price;
                    temp.weight = data[n].weight;
                    data[n].price = data[n+1].price;
                    data[n].weight = data[n+1].weight;
                    data[n+1].price = temp.price;
                    data[n+1].weight = temp.weight;
                }
        int sumweight = 0;
        int sumprice = 0;
        for(int k = 0;k < num; k++)
            if(data[k].weight<=(container-sumweight))
             {
                 sumprice += data[k].price;
                 sumweight += data[k].weight;
             }
        
        cout<<sumprice<<endl;
        
        cin>>num>>container;
    }
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n,c,i,j;
    cin>>n>>c;
    while(n!=0||c!=0)
    {
        int *w =new int[n];
        int *p =new int[n];
        int **a = new int*[n+1];
        for(i=0;i<=n;i++)
           a[i]= new int[c+1];
        for(i=0;i<n;i++)
          cin>>w[i];
        for(j=0;j<n;j++)
          cin>>p[j];
        for(int k=0;k<c+1;k++)
          a[0][k] = 0;
        for(i=0;i<n;i++)
            for(j=0;j<=c;j++)
            {
                if(w[i]>j)a[i+1][j] = a[i][j];
                else if(a[i][j]<a[i][j-w[i]]+p[i]) a[i+1][j] = a[i][j-w[i]]+p[i];
                else a[i+1][j] = a[i][j];
            }
        cout<<a[n][c]<<endl;
        cin>>n>>c;
    }
  return 0;
}