题解

代码如下

#include<bits/stdc++.h>
using namespace std;

struct node{
    int k,s;
}a[5002];

bool cmp(node x,node y){
    if(x.s==y.s)return x.k<y.k;
    return x.s>y.s;
}

int main(){
    int n,m;
    cin>>n>>m;
    m=floor((double)(m)*1.500);
    for(int i=1;i<=n;i++)
        cin>>a[i].k>>a[i].s;
    sort(a+1,a+n+1,cmp);
    int i=m;
    while(a[i].s==a[m].s){
        i++;
    }i--;
    cout<<a[m].s<<" "<<i<<"\n";
    for(int j=1;j<=i;j++){
        cout<<a[j].k<<" "<<a[j].s<<"\n";
    }
    return 0;
}