K-th Smallest in a Slice — Solution & Editorial

Back to the Problem

The intended structure is a persistent segment tree over value space (a wavelet tree or offline merge-sort-tree walk also works): version r minus version l−1 lets you descend to the k-th element in O(log V). At the provided test sizes, sorting each queried slice is acceptable.

Complexity: O((N + Q) log V) intended