title: Knapsack 0-1 path reconstruction (which items to take)
body: <p>I know how to solve knapsack 0-1 problem with dynamic programming approach, but I am having troubles figuring out which items to take without compromising the complexity of O(N * C) (N items, C capacity).</p>
  
  <p>Any ideas (I would prefer a bottom-up approach)?</p>