01背包源代码动态规划法

#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
    int n,c;
    cin>>c>>n;
    int i,j,m,a;
    int *w=new int[n+1];
    int *v=new int[n+1];
    for(i=1;i<=n;i++)
      cin>>w[i];
    for(i=1;i<=n;i++)
      cin>>v[i];
    int** array=new int*[n+1];
    for(i=1;i<=n;i++)
      array[i]=new int[c+1];
    for(i=0;i<=c;i++)
    {
      if(i<w[n])
        array[n][i]=0;
      else
        array[n][i]=v[n];
    }
    for(j=n-1;j>=1;j--)
    {
      for(i=0;i<=c;i++)
      {