80分求调(悬棺)

#include<bits/stdc++.h>
using namespace std;
const int M=5e4+5;
struct xs{
	int k,s;
}x[M];
int cmp(xs x,xs y){
	return (x.s>y.s)||(x.s==y.s&&x.k<y.k);
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
    	cin>>x[i].k>>x[i].s;
	}
	sort(x,x+n,cmp);
	int p=floor(m*1.5);
	cout<<x[p].s<<" ";
	int z=0;
	for(int i=0;i<n;i++){
		if(x[i].s>=x[p].s){
			z++;
		}
	}
	cout<<z<<endl;
	for(int i=0;i<z;i++){
		cout<<x[i].k<<" "<<x[i].s<<endl;
	}
    return 0;
}