P6363 软件工程实习

模拟即可，但是一定要注意四舍五入的问题。第一次统计的平均值不用四舍五入，但是第二次去除掉不合法的后取的平均值要四舍五入，推荐用 round 函数，其他就是模拟即可。

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

#define int long long

const int N = 1e3 + 5;

struct Node
{
	int score;
	int team;
	Node(int a, char c)
	{
		score = a;
		team = c;
	}
	Node() 
	{
		score = 0;
	}
};

bool cmp(const Node& g, const Node& l)
{
	if (g.score != l.score) return g.score > l.score;
	else return g.team < l.team;
}

Node a[N];
double p[N][N], q[N];

signed main()
{
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i].score;
		char c;
		cin >> c;
		a[i].team = c - 'A' + 1;
	}
	for (int i = 1; i <= k; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			cin >> p[i][j];
		}
	}
	for (int j = 1; j <= k; j++)
	{
		double scores = 0, sum = 0;
		for (int i = 1; i <= k; i++) scores += p[i][j];
		double pq = scores / k, cnt = 0;
		for (int i = 1; i <= k; i++)
		{
			if (abs(p[i][j] - pq) > 15) continue;
			sum += p[i][j];
			cnt++;
		}
		q[j] = round(sum * 1.0 / cnt);
	}
	for (int i = 1; i <= n; i++)
	{
		int z = a[i].score;
		int k = q[a[i].team];
		a[i].score = round(z * 0.6 + k * 0.4);
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++)
	{
		cout << a[i].score << " " << (char)(a[i].team + 'A' - 1) << endl;
	}
	return 0;
}