结构体排序

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

struct st
{
    int k,s;
};
int main()
{
    int n,m;
    cin >> n >> m;
    st a[n];
    for (int i=0;i<n;i++)
        cin >> a[i].k >> a[i].s;
    sort(a,a+n,[](st x,st y){
        if (x.s!=y.s)
            return x.s>y.s;
        else
            return x.k<y.k;
    });
    cout << a[int(m*1.5)-1].s << ' ';
    int cnt=m*1.5;
    for (int i=m*1.5;i<n;i++)
    {
        if (a[i].s!=a[int(m*1.5)-1].s)
            break;
        cnt++;
    }
    cout << cnt << endl;
    for (int i=0;i<cnt;i++)
        cout << a[i].k << ' ' << a[i].s << endl;
    return 0;
}