Greedy farmer

CodeChefOpen on judge ↗

A farmer is going to the city for selling the mangoes. He has $N$ bags and each bag has some kgs of mangoes. In the midway to the city he start feeling tired so he decide to distribute the weight of mango's bag. He has an integer array weight where the ith bag has $weight[i]$ kg of weight and given an integer $K$. He can perform the following operation at most $K$ times: - Take any bag of m

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