Introduction - If you have any usage issues, please Google them yourself
Method used divide and conquer a small element of k-input: program read from standard input data, the first line is an integer n (1 = <n<=100000)表示元素的个数,接下来的n行中每行有一个整数。最后一行是k,就是我们要找的第k小元素。