Minimum Energy

CodeChefOpen on judge ↗

Chef has an array $A$ of $n$ integers. He can increase an element of the array at the cost of 1 unit of energy. He wants to choose some $k$ integers from the array and make them all equal by increasing some of the selected elements or not changing anything if not required. He wants your help in finding the minimum energy he needs to use up to make some $k$ integers equal. Answer for

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI