CF 161 div2 B

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
int num[55];
int main()
{
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>num[i];
    sort(num+1,num+n+1);
    int cnt=n;
    while(k--)
    {
        cnt--;
    }
    if(cnt>=0)
        cout<<num[cnt]<<" "<<num[cnt]+1<<endl;
    else
        cout<<-1<<endl;
    return 0;
}