Find out the number of K-Large

Programming Question #: Find out the number of K-Large

Source: POJ (Coursera statement: The exercises completed on POJ will not count against the final results of Coursera. )

Note: Total time limit: 1000ms memory limit: 65536kB

Describe

The user enters N and K, then enters n positive integers (unordered), and the program finds the K-large number in cases where n integers are not sorted. Note that the K-large number means the number from the large to the small row in the K-bit.

Input

N

K

A1 A2 A3 A4 ... an

Output

B

Sample input

5232 3 12) 5 89

Sample output

32

Tips

This is a classic algorithm problem, is the company's common interview questions. After learning recursion and then look back at this problem, perhaps a new solution.

Find out the number of K-Large