Jim and the Orders

CodeChefOpen on judge ↗

Jim's Burgers has 'n' hungry burger fans waiting in line. Each unique order 'i' is placed by a customer at time 'ti' and the order takes 'di' unit of time to process. Given the information for all n orders, can you find and print the order in which all n customers will receive their burgers? If two or more orders are fulfilled at the exact same time 't' , sort them by ascending order number. ###I

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