Santa and Chocolates
This Christmas, Santa has a list of $N$ children for gift distribution. Initially, he decides to gift $A_i$ chocolates to the $i^{th}$ child. However, children are not happy with this distribution. He then decides to redistribute the chocolates in a way, such that: - Each child has **at least** one chocolate; - The difference of chocolates between any pair of children is **not more than** $K$.
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.
Sign in to chat with the tutor and save your progress.
Sign in to start