Editorial for VMSS Pre-Pre-Windsor P7 - Magical Bribery
Submitting an official solution before solving the problem yourself is a bannable offence.
This is a dynamic programming problem.
Let represent the maximum value for cards.
To get , we can try every package size.
More formally, you're trying to find a such that it maximizes .
The base case is when .