Candies Distribution

CodeChefOpen on judge ↗

On the occasion of John’s birthday, his friends attended the party. Suppose $M$ number of friends attended the party. John has $N$ number of boxes of candies. The number of candies in each box can vary. Now, John needs to distribute the boxes such that - Need to distribute only one box to each person. - Need to select boxes so that the difference between the box with the highest number of candies

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