← All problemsSign in

Easy Queries

CodeChefRating 2615Open on judge ↗

You are given an array A consisting of N positive integers. You have to answer Q queries on it of following type: - l r k : Let S denote the sorted (in increasing order) set of elements of array A with its indices between l and r. Note that set S contains distinct elements (i.e. no duplicates). You need to find kth number in it. If such a number does not exist, i.e. the S has less than k element

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

Sign in to chat with the tutor and save your progress.

Sign in to start