80分(AC必关)

#include<bits/stdc++.h>
using namespace std;
struct p{
    int k,s;
};
p a[5010];
bool cmp(const p &a,const p &b){
    if(a.s!=b.s)return a.s>b.s;
    return a.k<b.k;
}
int main(){
    int n,m1;
    cin>>n>>m1;
    for(int i=1;i<=n;i++){
        cin>>a[i].k>>a[i].s;
    }
    int m=1.5*m1;
    sort(a+1,a+n+1,cmp);
    int fen=a[m+1].s,ren=0;
    int k=1;
    while(a[k++].s>=fen){
        ren++;
    }
    cout<<fen<<" "<<ren<<"\n";
    for(int i=1;i<=ren;i++){
        cout<<a[i].k<<" "<<a[i].s<<"\n";
    }
    return 0;
}