NaMo and Queries

CodeChefOpen on judge ↗

NaMo is a very brilliant student. Today, his teacher gave him a long assignment. Assignment contains N integers and Q Queries. For each query, NaMo has to find Kth smallest number among N integers. Input - First line contains two space separated integers N and Q i.e. No. of Integers and No. of Queries. - Next Line contains N space separated integers A1, A2, ..., AN - Each of next Q lines con

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