Unknown M

CodeChefOpen on judge ↗

You are given a sequence of $N$ positive integers: $A = (A_1 ,A_2 ,A_3 ……A_n)$, and $Q$ queries. For each query an integer $M$ will be given and you have to calculate the $M$th smallest positive integer that is $not$ present in the array. ### Input - The first line contains two space separated integers $N$ and $Q$ denoting the number of integers in the array and number of queries. - The second l

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