knapsack problem

#include <iostream>

using namespace std;

int main()
{
    int m=8;
    int n=4;
    int p[]= {1,2,5,6};
    int wt[]= {2,3,4,5};
    int k[n+1][m+1];
    for(int i=0; i<=n; i++)
    {
        for(int w=0; w<=m; w++)
        {
            if(i==0||w==0)
                k[i][w]=0;
            else if(wt[i]>w)
            {
                k[i][w]=k[i-1][w];
            }
            else
            {
                k[i][w]=max(k[i-1][w],p[i]+k[i-1][w-wt[i]]);
            }

        }
    }
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<=m;j++)
            cout<< k[i][j]<< " ";
        cout<<endl;
    }
cout<<endl;
cout<<k[n-1][m];
    return 0;
}