You just broke into a treasure vault, and want to take as much as you can. But your bag will burst if its contents are too heavy. So, you must aim to steal the diamonds with the greatest monetary value whose total weight does not exceed your bag's carrying capacity.
Example:
The optimal solution consists of picking the second, third, and fourth diamonds (omitting the first) for a total value of $146 and weight of 164 lbs. However, you do earn credit for suboptimal solutions, as long as their total weight does not exceed your bag's carrying capacity.
Visual size and color of diamonds must be ignored.
There are 12 items.
You will have 1 minute to make each choice. If time runs out, your current selection will be submitted.
You are not expected to be able to solve every item exactly, and may have to resort to heuristics.