← All problemsSign in

Need a Valentine

Need a Valentine Yatin wants to be prepared for the Valentine week. So he wants to gift chocolates to $K$ number of girls. He has a set of $N$ distinct types of chocolate boxes which are numbered from $1$ to $N$ with each box containing $Ai(1 <= i <= n)$ number of chocolates respectively. Yatin is a bit nervous , so he needs your help in the distribution of chocolates. You are good friend

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

Sign in to chat with the tutor and save your progress.

Sign in to start