Codeforces-977C 小于或等于（水坑）

 

C. Less or Equal

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a sequence of integers of length nn and integer number kk. You should print any integer number xx in the range of [1;109][1;109](i.e. 1≤x≤1091≤x≤109) such that exactly kk elements of given sequence are less than or equal to xx.

Note that the sequence can contain equal elements.

If there is no such xx, print "-1" (without quotes).

Input

The first line of the input contains integer numbers nn and kk (1≤n≤2⋅1051≤n≤2⋅105, 0≤k≤n0≤k≤n). The second line of the input contains nninteger numbers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the sequence itself.

Output

Print any integer number xx from range [1;109][1;109] such that exactly kk elements of given sequence is less or equal to xx.

If there is no such xx, print "-1" (without quotes).

Examples

input

Copy

7 4
3 7 5 1 10 3 20

output

Copy

6

input

Copy

7 2
3 7 5 1 10 3 20

output

Copy

-1

Note

In the first example 55 is also a valid answer because the elements with indices [1,3,4,6][1,3,4,6] is less than or equal to 55 and obviously less than or equal to 66.

In the second example you cannot choose any number that only 22 elements of the given sequence will be less than or equal to this number because 33 elements of the given sequence will be also less than or equal to this number.

给你一个长度为n的整数序列和一个数k。 您应该在[1; 1e9]（即1≤x≤1e9）的范围内输出任何整数x，使得给定序列的k个元素恰好小于或等于x。 请注意，该序列可以包含相同的元素。 如果没有这样的x，则输出“-1”（不含引号）

#include<iostream>
#include<algorithm>
using namespace std;
int a[1000000];
int main(){
	int n,k;
	while(cin>>n>>k){
	for(int i=0;i<n;i++)
	cin>>a[i];
	sort(a,a+n);
	if(k==0){
 	    if(a[0]<=1)          //题目给了，x值最小是1；
	    cout<<-1<<endl;      //所以说，假如a[0]还小于1的话，也是不存在x.
		else
		cout<<1<<endl;
	}
	else{
	if(n==k){
		cout<<a[n-1]<<endl;
	}
	else if(a[k-1]<a[k]){
			cout<<a[k-1]<<endl;
		}
	else {
	  cout<<-1<<endl;
	}}}
	return 0;
}