20分求助 只过了前2个点！

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

struct people
{
	int x;
	int score;
}a[10010],b[100010];
void maopao_sort(people a[], int n)
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n - i; j++)
		{
			if (a[j].score > a[j + 1].score)
			{
				swap(a[j].score, a[j + 1].score);
				swap(a[j].x, a[j + 1].x);
			}
		}
	}
}
int n, m;
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i].x >> a[i].score;
	maopao_sort(a, n);
	int s = floor(m * 1.5);
	int k = a[n-s+1].score;
	int t;
	for (int i = n; i >=1; i--)
	{
		if (a[i].score == a[i -1].score && a[i].x > a[i -1].x)
		{
			swap(a[i].x, a[i -1].x);
		}

	}
	cout << k << " ";
	int num = 0;
	for (int i = n; i >= 1; i--)
	{
		if (a[i].score >= k)
			num++;
	
	}

	cout << num << endl;

	for (int i = n; i >= 1; i--)
	{
		if (a[i].score >= k)
		{
			
			
			cout << a[i].x << " " << a[i].score << endl;
		}
	}


	return 0;
}