AC

#include <iostream>//zhuqirui防抄袭
#include <iomanip>
#include <cmath>
#include <cstring>
#include <algorithm>//2024/1/23/22:40
using namespace std;
#define LL long long
const int N=1e5+10;
const int INF=0x3f3f3f3f;//zhuqirui防抄袭
int n,k;
struct juruo
{
	int mc;
	int jg;
};
juruo a[N];
bool cmp(juruo a1,juruo a2)
{
	return a1.jg>a2.jg;
}
int main()
{
	freopen("jr.in","r",stdin);//zhuqirui防抄袭
	freopen("jr.out","w",stdout);//zhuqirui防抄袭
	cin>>n>>k;
	for(int i=1;i<=n;i++)//zhuqirui防抄袭
	{
		cin>>a[i].mc>>a[i].jg;//zhuqirui防抄袭
	}
	sort(a+1,a+n+1,cmp);//zhuqirui防抄袭
	cout<<a[k].mc<<" "<<a[k].jg;//zhuqirui防抄袭
	return 0;
}