不多说,代码如下:
#include<bits/stdc++.h>
using namespace std;
struct point{
int x;
int y;
};
point k[5005];
int comp(const point &a,const point &b){
if(a.y>b.y) return 1;
if(a.y<b.y) return 0;
if(a.x<b.x) return 1;
return 0;
}
int main(){
int n,m,i,tot,cnt=0;
cin>>n;
cin>>m;
for(i=1;i<=n;i++){
cin>>k[i].x;
cin>>k[i].y;
}
sort(k+1,k+1+n,comp);
tot=floor(m*1.5);
for(i=tot+1;i<=n;i++){
if(k[i].y==k[tot].y) cnt++;
else break;
}
cout<<k[tot].y<<" "<<tot+cnt<<endl;
for(i=1;i<=tot+cnt;i++){
cout<<k[i].x<<" "<<k[i].y<<endl;
}
return 0;
}