The Sorting Ceremony

CodeChefOpen on judge ↗

$N$ people have booked tickets to the Pronites. Each ticket has a number from $1$ to $N$ written on it. No two people have the same ticket number. On the day of the event, Sharaj, the coordinator, finds that these $N$ people have randomly arranged themselves into two separate queues ( $A$ and $B$ ) of length $L$ and $M$ respectively. Sharaj wants to form a single queue of these people. In this

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