题解 100% AC

#include<bits/stdc++.h>
using namespace std;
struct candidate{
    int k,s;
}a[5005];
bool cmp(candidate b,candidate c){
    if(b.s!=c.s) return b.s>c.s;
    else return b.k<c.k;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i].k>>a[i].s;
    sort(a+1,a+n+1,cmp);
    m=m*1.5-m%2/2;
    int x=a[m].s,i=1;
    while(i++)if(a[i].s<x)break;
    cout<<x<<" "<<i-1<<endl;
    for(int j=1;j<i;j++)cout<<a[j].k<<" "<<a[j].s<<endl;
    return 0;
}