Problem D

本能~ 

 没读完时候下了一跳,  如果给出的矩形不是相互包含的,而是相互交错的, 那该用到二维线段树了吧~~~  胡思乱想·~~~

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
//#include "myAlgorithm.h"

#define MAX 100005
#define INF (1e8 + 5)
#define eps 1e-30
#define Rep(s, e) for( int i = s; i <= e; i++)
using namespace std;
int n, k;
int a[MAX];
int main()
 {
    //freopen("in.txt", "w", stdout);
    while(cin>>n>>k){
        Rep(0, n - 1)cin>>a[i];
        if(k > n){cout<<-1<<endl; continue;}
        sort(a, a + n);
        cout<<a[ n - k ]<<" "<<0<<endl;
    }
    return 0;
}
/*
3 2 -1 -1 1
3 1 -1 -1 1
*/