只得了90分T_T

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct ss
{
    int xuehao;
    int fenshu;
};
bool pai(ss a,ss b)
{
    if(a.fenshu > b.fenshu)
    {
        return true;
    }
    if(a.fenshu == b.fenshu)
    {
        if(a.xuehao < b.xuehao)
        {
            return true;
        }
        else
        {
            return false;
        }
    }
    return false;
}
int main()
{

    int n,m;
    cin >> n >> m;
    vector<ss>a(n);
    for(int i =0;i < n;i++)
    {
        cin >> a[i].xuehao >> a[i].fenshu;
    }
    sort(a.begin(),a.end(),pai);
    int xian=m*1.5;
    int xianfs=a[xian-1].fenshu;
    int renshu=xian;
    for(int i = xian;i < n;i++)
    {
        if(a[i].fenshu==xianfs)
        {
            renshu++;
        }
        else if(a[i].fenshu<xianfs)
        {
            break;
        }
    }
    cout << xianfs << " " <<renshu<<endl;
    for(int i = 0;i < renshu;i++)
    {
        if(a[i].xuehao==0)
        {

            break;
        }
        cout << a[i].xuehao <<  " " << a[i].fenshu << endl;
    }
    return 0;
}