Coder-Strike 2014 - Round 1 B. Network Configuration

B. Network Configuration 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The R1 company wants to hold a web search championship. There were n computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly affects the result. The higher the speed of the Internet is, the faster the participant will find the necessary information. Therefore, before the competition started, each computer had its maximum possible data transfer speed measured. On the i-th computer it was a_i kilobits per second.

There will be k participants competing in the championship, each should get a separate computer. The organizing company does not want any of the participants to have an advantage over the others, so they want to provide the same data transfer speed to each participant's computer. Also, the organizers want to create the most comfortable conditions for the participants, so the data transfer speed on the participants' computers should be as large as possible.

The network settings of the R1 company has a special option that lets you to cut the initial maximum data transfer speed of any computer to any lower speed. How should the R1 company configure the network using the described option so that at least k of n computers had the same data transfer speed and the data transfer speed on these computers was as large as possible?

Input

The first line contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 100) — the number of computers and the number of participants, respectively. In the second line you have a space-separated sequence consisting of n integers: a₁, a₂, ..., a_n (16 ≤ a_i ≤ 32768); number a_i denotes the maximum data transfer speed on the i-th computer.

Output

Print a single integer — the maximum Internet speed value. It is guaranteed that the answer to the problem is always an integer.

Sample test(s)

input

3 2
40 20 30

output

30

input

6 4
100 20 40 20 50 50

output

40

#include<iostream> 
#include<cmath> 
#include<cstring> 
#include<algorithm> 
using namespace std;
int a[100005];
int main()
{
	int i,j,k,m,n;
	while(cin>>m>>n)
	{
		memset(a,0,sizeof(a));
		for(i=0;i<m;i++)
			cin>>a[i];
		sort(a,a+m);
		cout<<a[m-n]<<endl;
	}
}