DJ’s Thepla

CodeChefOpen on judge ↗

DJ's Thepla has N hungry Thepla fans waiting in line. Each unique order, i , is placed by a customer at time Ti, and the order takes Di units of time to process. Given the information for all orders, can you find and print the order in which all customers will receive their theplas? If two or more orders are fulfilled at the exact same time , sort them by ascending order number. Input Form

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