Unbounded Knapsack

It is allowed to use an unlimited quantity of an item.

Bottom-up Approach

Recurrence:

dp[i][c] = max(dp[i-1][c], profit[i] + dp[i][c - weight[i]])

Code

// TODO