求(10pts)
  • 板块题目总版
  • 楼主Gx120905
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/12/11 18:45
  • 上次更新2024/12/11 21:55:23
查看原帖
求(10pts)
1558494
Gx120905楼主2024/12/11 18:45

在这里

#include <bits/stdc++.h>
using namespace std;

struct st {
	string hao;
	long long fen = 0;
};

bool cmp(st a, st b) {
	if (a.fen > b.fen) {
		return 1;
	} else {
		return 0;
	}
}
st c[5005];

int main() {
	long long a = 0;
	double b = 0;
	cin >> a >> b;

	for (long long i = 0; i < a; i++) {

		cin >> c[i].hao >> c[i].fen;
	}

	sort(c, c + a, cmp);
	double ac = b / 2 * 3;
	long long ab = int(ac);

	for (long long i = ab ; i < a; i++) {

		if (c[ab - 1].fen == c[i].fen) {
			ab++;
		}
	}

	cout << c[ab - 1].fen << ' ' << ab << endl;

	for (long long i = 0; i < ab; i++) {

		cout << c[i].hao << ' ' << c[i].fen << endl;
	}
}
2024/12/11 18:45
加载中...