10分

#include<bits/stdc++.h>
using namespace std;
//分数线判定0.0 
int p,r;
struct node{
	int hs,fs;
}a[10001];
int n,m;
bool cmp(node x,node y){
	if(x.fs!=y.fs) return x.fs>y.fs;
	if(x.fs==y.fs&&x.hs!=y.hs) return x.hs<y.hs;
}
int main(){
	cin>>n>>m; 
	m=floor(m*=1.5);
	for(int i=1;i<=n;i++){
		cin>>a[i].hs>>a[i].fs;
	}
	sort(a+1,a+n+1,cmp);
	p=a[m*3/2-1].fs;      //计算分数线 
    for(int i=1;i<=n;i++)
    {
    	if(a[i].fs>=p) r++;//计算人数 
	}
	cout<<p<<' '<<r<<endl;
	 for(int i=1;i<=r;i++){
	 	cout<<a[i].hs<<' '<<a[i].fs<<endl;
	 }

	return 0;
}