This problem is known in computing as the Knapsack Problem. Knapsack problems appear all the time in the real world. For example if you are moving house or if you are going on holiday. The Knapsack Problem is an abstraction of any problem where you need to know how many things you can have with the most value.
Choose blocks with the highest total value (in dollars) but they must fit in your bag so you need to keep overall weight less than 15kg.
