题解 | 分数线划定

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

struct Con{
    int id;
    int score;
};

bool cmp(Con &a,Con &b){
    if(a.score!=b.score) return a.score>b.score;
    return a.id<b.id;
}

int main() {
    int n,m;
    cin>>n>>m;
    Con con[n];
    for(int i=0;i<n;i++){
        cin>>con[i].id>>con[i].score;
    }
    sort(con,con+n,cmp);
    int t=(int)(1.5*m);
    if(t>n) t=n;
    int line=con[t-1].score;
    int cnt=0;
    while (cnt < n && con[cnt].score >= line) {
        cnt++;
    }
    cout<<line<<" "<<cnt<<endl;
    for(int i=0;i<cnt;i++){
        cout<<con[i].id<<" "<<con[i].score<<endl;
    }

    return 0;
}