Now we need to show that an initial greedy choice of item h leads to an
optimal solution. We can make the greedy choice first.
We can fill the knapsack with the highest value-per-pound item.
Thus, V = L(i)
If we choose the same amount L(h) of item h first (we cannot choose more or
we would have by the above result), then the value will be
Thus we can make the greedy choice first.