题解

#include<iostream>
#include<algorithm>
using namespace std;
struct C{
	int k,s;
}c[5001];
bool cmp(const C& a,const C& b){
	if(a.s!=b.s)
		return a.s>b.s;
	return a.k<b.k;
}
int main(){
	int n,m,cnt=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>c[i].k>>c[i].s;
	sort(c+1,c+n+1,cmp);
	m=m*3/2;
	for(int i=1;c[i].s>=c[m].s;i++,cnt++);
	cout<<c[m].s<<" "<<cnt<<endl;
	for(int i=1;i<=cnt;i++)
		cout<<c[i].k<<" "<<c[i].s<<endl;
	return 0;
}