题解

#include <iostream>
#include <algorithm>
using namespace std;
struct people{
    int id;
    int score;
}s[5050];
bool cmp(people a, people b){
    if(a.score == b.score){
        return a.id < b.id;
    }
    else{
        return a.score > b.score;
    }
}
int main(){
    int n, m;
    cin >> n >> m;
    m += m / 2;
    for(int i=1; i<=n; i++){
        cin >> s[i].id >> s[i].score;
    }
    sort(s+1, s+n+1, cmp);
    int idx = 1;
    int sc = s[m].score;
    while(s[idx].score >= sc){
        idx++;
    }
    cout << sc << " " << idx - 1 << endl;
    for(int i=1; i<idx; i++){
        cout << s[i].id << " " << s[i].score << endl;
    }
    return 0;
}