Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Since all the unselected numbers are decreasing at the same rate, we should greedily select <code>k</code> largest values.
The <code>i<sup>th</code> largest number (<code>i = 1, 2, 3,…k</code>) should decrease by <code>(i - 1)</code> when it is picked.
Add <code>0</code> if the decreased value is negative.