代码如下

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
struct node{
	int id,point;
}a[5005];
int n,m;
bool cmp(node a,node b){
	if(a.point!=b.point)return (a.point>b.point);
	return (a.id<b.id);
}
int main(){
	cin>>n>>m;
	m=floor(m*1.5);
	for(int i=1; i<=n; i++)cin>>a[i].id>>a[i].point;
	sort(a,a+n+1);
	int ans=0;
	for(int i=1; i<=n; i++)
		if(a[m].point<=a[i].point)ans++;
	cout<<a[ans].point<<' '<<ans<<'\n';
	for(int i=1; i<=ans; i++)
		cout<<a[i].id<<a[i].point<<'\n';
}