Consider the following game. Alice and Bob keep a list of n distinct numbers, each with 2n distinct numbers in total. Your job is to find the n'th smallest value of these 2n numbers. However, you can only ask them to tell you their k'th smallest value.
Give an algorithm that finds the n'th smallest value of the 2n numbers using at most O(log n) questions.