College Admission

CodeChefOpen on judge ↗

N people have ranks in college entrance exams numbered from $1 to N$ such that student X ranked before student Y if X is less than Y . Now, the people do not necessarily arrive at the college on time, so you decide of an unusual way of handling the situation. At the start, you fulfill the admission of the student who ranked first (so if a student having 1 is available then that student can get the

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