In order to solve this problem i need to know occurrence of value X or the Kth element(after sorting) in a subarray for an array. can implicit treap be used to find the Kth element(after sorting) of a subarray?

In Implicit Treap the key values are not stored explicitly so in my approach i can`t use implicit treap like BST to find Kth element.