Hard problem always comes with short problem description. But this is an easy problem
with easy description, get start coding now and solve it!
You are given a sequence of integers and a number k, output the kth smallest number.
Input contains several test cases, each test case starts with a number n,
1<=n<=1,000,000. Followed by n integers and a number k on a line, 1<=k<=n.
For each test case, output the answer on a line by itself.
2 1 2 1 5 1 2 3 4 5 3
1 3
Migrated from old NTUJ.
| No. | Testdata Range | Score |
|---|