来自蒟蒻的代码:

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int num,sco;
}p[5010];
bool cmp1(node a,node b)
{return a.num<b.num;}
bool cmp2(node a,node b)
{return a.sco>b.sco;}
int main()
{
	int n,m;
	cin>>n>>m;
	m=int(m*1.5);
	for(int i=0;i<n;i++)cin>>p[i].num>>p[i].sco;
	sort(p,p+n,cmp1);
	sort(p,p+n,cmp2);
	int cnt=0;
	for(int i=m;p[i].sco==p[m-1].sco&&i<n;i++)cnt++;
	m+=cnt;
	cout<<p[m-1].sco<<' '<<m<<endl;
	for(int i=0;i<m;i++)
	cout<<p[i].num<<' '<<p[i].sco<<endl;
	return 0;
}