LAG又来水题解了…
#include<bits/stdc++.h>
using namespace std;
struct aa{
int xh;
int fs;
}a[10005];
bool cmp(aa a,aa b){
if(a.fs>b.fs){
return 1;
}else if(a.fs<b.fs){
return 0;
}else{
return a.xh<b.xh;
}
}
int main(){
long long n,m;
cin>>n>>m;
m*=1.5;
for(int i=1;i<=n;i++){
cin>>a[i].xh>>a[i].fs;
}
sort(a+1,a+n+1,cmp);
cout<<a[m].fs<<" ";
while(a[m].fs==a[m+1].fs){
m++;
}
cout<<m<<endl;
for(int i=1;i<=m;i++){
cout<<a[i].xh<<" "<<a[i].fs<<endl;
}
return 0;
}