rt.代码如下.建议先运行，中间一长堆用到x的其实就是swap

#include"bits/stdc++.h" 
using namespace std;
struct k
{
	int score;
	int num;
}
a[5003];
int main()
{
	int n,m,x,ans=0;
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i].num);
		scanf("%d",&a[i].score);
	}
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<n;j++)
		{
			if (a[i].score<a[j].score)
			{
				x=a[i].score;
				a[i].score=a[j].score;
				a[j].score=x;
				x=a[i].num;
				a[i].num=a[j].num;
				a[j].num=x;
			}
			if (a[i].score==a[j].score&&a[i].num>a[j].num)
			{
				x=a[i].num;
				a[i].num=a[j].num;
				a[j].num=x;
			}
		}
	}
	x=a[(m*3)/2].score;
	printf("%d",x);
	printf(" ");
	for (int i=1;i<=n;i++)
	{
		if (a[i].score>=x)
		{
			ans++;
		}
	}
	printf("%d",ans);
	for (int i=1;i<=n;i++)
	{
		if (a[i].score>=x)
		{
			printf("%d",a[i].num);
			printf(" ");
			printf("%d",a[i].score);
			printf("\r\n");
		}
		return 0;
	}
}