2 solutions

  • 0
    @ 2025-7-23 14:08:54
    #include<bits/stdc++.h>
    using namespace std;
    typedef pair<int,int> PII;
    const int N=5010;
    PII a[N];
    bool cmp(PII a,PII b)
    {
       if(a.first>b.first)
       {
            return 1;
       }
       if(a.first==b.first&&a.second<b.second)
       {
            return 1;
       }
       return 0;
    }
    int main()
    {
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i].second>>a[i].first;
        }
        sort(a+1,a+n+1,greater<PII>());
        int cnt=m*1.5;
        int res=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i].first>=a[cnt].first)
            {
                res++;
            }
        }
        cout<<a[cnt].first<<" "<<res<<endl;
        sort(a+1,a+n+1,cmp);
        for(int i=1;i<=res;i++)
        {
            cout<<a[i].second<<" "<<a[i].first<<endl;
        }
        return 0;
    }
    

    Information

    ID
    426
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    8
    Tags
    # Submissions
    13
    Accepted
    6
    Uploaded By