大佬求调

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

struct A_score{
	int id;
	int score;
}a[114514];
int n, m;

bool cmp(A_score a, A_score b){
	if(a.id != b.id) return a.score > b.score;
	else return a.id < b.id;
}

int main(){
	cin >> n >> m;
	for(int i=1; i<=n; i++) cin >> a[i].id >> a[i].score;
	sort(a+1, a+1+n, cmp);
	int iiiiii = floor(m*1.5);
	int mountain = a[iiiiii].score;
	int ans = 0;
	for(int i=1; i<=n; i++)
		if(a[i].score >= mountain) ans++;
	cout << mountain << ' ' << ans << endl;
	for(int i=1; i<=n; i++) 
		if(a[i].score >= mountain) cout << a[i].id << ' ' << a[i].score << endl;
	return 0;
}