鸡汤又又又来咯

#include<bits/stdc++.h>
using namespace std;
struct students
{
int k;
int s;
};
bool cmp(students x1,students x2)//创建cmp函数进行排序
{
if(x1.s<x2.s || x1.s>x2.s)
{
return x1.s>x2.s;
}
else
{
return x1.k<x2.k;
}
}
int main()
{
int n,m;
cin>>n>>m;
students a[5001]={0};
for(int i=1;i<=n;i++)
{
cin>>a[i].k>>a[i].s;
}
sort(a+1,a+1+n,cmp);
int num=floor(m*1.5),num2=a[num].s;
while(a[num+1].s==num2)
{
num++;
}
cout<<num2<<" "<<num<<endl;
for(int i=1;i<=num;i++)
{
cout<<a[i].k<<" "<<a[i].s<<endl;
}
return 0;
}