A Big Order

CodeChefOpen on judge ↗

Jethalal has received a big order for $n$ LEDs, the order demands to be delivered in a maximum of $$K$$ trips. The weights of each product to be delivered is given as $w_1,w_2,w_3…w_n.$ Respectively The LEDs are lined up in a queue which means LEDs should be transported in the order in which they have been kept that is LEDs 1, 2, and 3 can be transported together but not 1,5 and 7. On every tr

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