蒟蒻求助,20分代码
查看原帖
蒟蒻求助,20分代码
329691
zzyznb楼主2021/8/19 09:49
#include<iostream>
using namespace std;
struct vol 
{
	int num, mar;
};
vol a[50100];
int main()
{
	int n, m, line=0, p=0, f;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i].num >> a[i].mar;
	for (int i = n-1; i >= 1 ; i--)
	{
		for (int j = 1; j <=i ; j++)
		{
			if (a[j].mar > a[j + 1].mar)
				swap(a[j], a[j + 1]);
		}
	}
	f = int(m * 1.5);
	line = a[n-f+1].mar;
	int i = n;
	while (a[i].mar >= line)
	{
		if (a[i].mar == a[i - 1].mar && a[i].num > a[i-1].num)
			swap(a[i-1], a[i]);
        p++;
		i--;
	}
	cout << line << " " << p << endl;
	i = n;
	while (a[i].mar >= line)
	{
		cout << a[i].num <<" "<< a[i].mar << endl;
		i--;
	}
	return 0;
}
2021/8/19 09:49
加载中...