Less or Equal 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. 1x1091≤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 (1n21051≤n≤2⋅1050kn0≤k≤n). The second line of the input contains nn integer numbers a1,a2,,ana1,a2,…,an (1ai1091≤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和m,在[1,1e9]中,找出一个数x,使得在给出的长为n的数列中小于或等与x的数只有m个。如果有,输出这个数x,否则,输出-1,答案不唯一.

思路:排序一下,然后直接看a[m-1] 和a[m] 是否相同,如果相同,那么必定不存在这样一个x,否则,a[m-1],这个数,一定是一个满足条件的x。(注意,需要特判一下m为0的情况!!)

#include "iostream"
#include "algorithm"
using namespace std;
const int Max=2e5+10;
int a[Max];
int main()
{
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a,a+n);
    if(m==0){
        if(a[0]<=1) cout<<"-1"<<endl;
        else cout<<"1"<<endl;
    }
    else{
        if(a[m-1]==a[m]) cout<<"-1"<<endl;
        else cout<<a[m-1]<<endl;
    }
    return 0;
}

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页