0/1 knapsack

You have a knapsack of integer capacity. Each item is given as [weight, value] and can be taken at most once. Return the maximum total value of a subset whose total weight does not exceed the capacity. Capacity is non-negative; the item list may be empty.