Airport Security

CodeChefOpen on judge ↗

Aswin and Mayank were going to take a flight from Bengaluru to Kochi. Aswin came late to the Airport and there was a chance that they would miss the flight. There are $N$ security counters (Numbered from *1 to N* ) , everyone has to pass from counters *1 to N* and each counter takes $a_i$ minutes to complete the security check. Since Aswin and Mayank were already late they were allowed go from

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