Find the optimal way to use combinations of summands to get the most sum with a limited number of summands
The problem is a generalization of the set packing problem (exercise: why?), and therefore it is NP-hard even to approximate in a very weak sense.  See Maximum Set Packing and Maximum Clique in the compendium.