我这只有30分,求助大神
查看原帖
我这只有30分,求助大神
690206
JHUNSK211ZB楼主2022/5/14 23:50
#include<iostream>
#include<algorithm>
#define MAXN 5050
using namespace std;
struct competitor
{
	int ID;
	int score;
};
int cmp(competitor x, competitor y)
{
	if (x.score != y.score) return x.score > y.score;
	else return x.ID < y.ID;
}
struct competitor a[MAXN];
int main()
{
	int n, m;
	int line;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> a[i].ID >> a[i].score;
	sort(a, a + n, cmp);
	line = (int)(m * 1.5);
	if (a[line - 1].score == a[line].score)
		line++;
	cout << a[line-1].score << " " << line<<endl;
	for (int i = 0; i < line; i++)
		cout << a[i].ID <<" "<< a[i].score << endl;
	return 0;
}
2022/5/14 23:50
加载中...