结构体

#include<bits/stdc++.h>
using namespace std;
struct stu{
int k;
int s;
}a[5010];

bool cmp(stu x,stu y){
if(x.s != y.s) return x.s>y.s;
else return x.k<y.k;
}

int main(){
int n,m,sum=0;
cin>>n>>m;
int z = m*1.5;
for(int i=1;i<=n;i++){
cin>>a[i].k>>a[i].s;
}
sort(a+1,a+n+1,cmp);
int cj = a[z].s;
for(int i=1;i<=n;i++){
if(a[i].s<cj)
break;
sum++;
}
cout<<cj<<' '<<sum<<endl;
for(int i=1;i<=n;i++){
if(a[i].s<cj)
break;
cout<<a[i].k<<' '<<a[i].s<<endl;
}

return 0;

}