全“wa”求调

#include<iostream>
#include<algorithm>
using namespace std;
struct man{
	int num,score;
};
struct luqu{
	int nu,sc;
};
bool cmp(luqu a,luqu b) {
	if(a.sc==b.sc) {
		return a.nu<b.nu;
	}
	return a.sc>b.sc;
}
int n,m,h,sum=0;
int main() {
	cin >> n >> m;
	man a[5005];
	luqu b[5005];
	for(int i=1;i<=n;i++) {
		cin >> a[i].num >> a[i].score;
	}
	h=a[m-1].score;
	for(int i=1;i<=n;i++) {
		if(a[i].score>=h) {
			b[sum].nu=a[i].num,b[sum].sc=a[i].score;
			sum++;
		}
	}
	sort(b+1,b+sum+1,cmp);
	cout << h << " " <<sum <<endl;
	for(int i=1;i<=sum;i++) {
		cout << b[i].nu << " " << b[i].sc << endl;
	}
	return 0; 
}