0-1 knapsack

#include<bits/stdc++.h>
using namespace std;
int ks(int c,int wt[],int val[],int n)
{
   int i, w;
   int v[n+5][c+5];

   for (i = 0; i <= n; i++)
   {
       for (w = 0; w <= c; w++)
       {
           if (i==0 || w==0)
               v[i][w] = 0;
           else if (wt[i] > w)
                 v[i][w] = v[i-1][w];
           else
            v[i][w] = max(v[i-1][w],val[i-1] + v[i-1][w-wt[i-1]]);

       }
   }

   return v[n][c];
}

int main()
{
    int val[5],wt[5],n,ans;
    int c;
    cin>>c;
    for(int i=0;i<3;i++)
        cin>>val[i];
    for(int i=0;i<3;i++)
        cin>>wt[i];
        n=sizeof(val)/sizeof(val[0]);
        ans=ks(c,wt,val,n);
        cout<<ans<<endl;
        return 0;
}