Largest Target

CodeChefOpen on judge ↗

Ayush is a competitive programmer. He downloaded a set of $N$ questions with various difficulties $d_i$. He can solve a problem with difficulty $D$ if his skill level is greater than or equal to $D$. He has various queries, in each query he wants to know what is the highest difficulty problem he is able to solve (he only wants to know the difficulty and not index of the problem) ###Input:

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