0分求条

#include<bits/stdc++.h>
using namespace std;
int n,k;
struct ji{
	int score;
	double io;
};
int f(ji a,ji b){
	return a.score>b.score;
}
int main(){
	cin>>n>>k;
	ji a[10005];
	for(int i=0;i<n;i++){
		cin>>a[i].score>>a[i].io;
	}
	sort(a,a+n,f);

		printf("%d %g",a[k-1].score,a[k-1].io);

	return 0;
}