题解 | 分数线划定

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;

int main() {
    int n,m;
    cin>>n>>m;
    int t=floor(m*1.5);
    vector<pair<int,int>> v(n);
    
    while (n--) {
        int k,s;
        cin>>k>>s;
        v.push_back({k,s});
    }

    sort(v.begin(), v.end(),[](const auto& a ,const auto & b){
        return a.second==b.second?a.first<b.first:a.second>b.second;
    });

    int lines=v[t-1].second;
    int ci=0;
    for(int i=0;i<v.size();i++){
        if(v[i].second>=lines){
            ci++;
        }
    }

    cout<<lines<<" "<<ci<<endl;

    for(int i=0;i<ci;i++){
        cout<<v[i].first<<" "<<v[i].second<<endl;
    }





}