knapsackTop.cpp

int  N, V[100], W[100], memo[100][100];

int value(int id, int w)
{
  if (memo[id][w] != -1)  return memo[id][w]; //Memoization
  if (id == N || w == 0)       return 0;    //Base Case
  else  if (W[id] >w)          return memo[id][w] = value(id + 1, w);
  else                return memo[id][w] = max(value(id + 1, w),  V[id] + value(id + 1, w - W[id]));
}