C++14(g++5.4) 解法, 执行用时: 3ms, 内存消耗: 484K, 提交时间: 2020-08-23 21:03:33

#include <cstdio>
#include <algorithm>

using namespace std;

struct abc
{
    int b[9],sum,bianhao;
    double avg,weizhi[9],zongweizhi;
};

int n;
abc a[1010];
double avg[9],temp[9];

bool cmp(abc a,abc b)
{
    if (a.zongweizhi > b.zongweizhi)
        return true;
    else
        if (a.zongweizhi == b.zongweizhi && a.sum > b.sum)
            return true;
        else
            if (a.zongweizhi == b.zongweizhi && a.sum == b.sum)
                return a.zongweizhi < b.zongweizhi;
    return false;
}

int main()
{
    //freopen("F:\\rush.txt","r",stdin);
    scanf("%d",&n);
    for (int i = 1;i <= n;i++)
    {
        a[i].sum = 0;
        a[i].bianhao = i;
        for (int j = 1;j <= 8;j++)
            {
                scanf("%d",&a[i].b[j]);
                a[i].sum+=a[i].b[j];
                avg[j] += a[i].b[j];
            }
    }
    for (int j = 1;j <= 8;j++)
        avg[j]/=n;
    for (int i = 1;i <= n;i++)
        for (int j = 1;j <= 8;j++)
        {
            double temp3 = a[i].b[j]-avg[j];
            if (temp3<0)
                temp3 = -temp3;
            temp[j] += temp3;
        }
    for (int j = 1;j <= 8;j++)
        temp[j]/=n;
    for (int i = 1;i <= n;i++)
        for (int j = 1;j <= 8;j++)
            if (temp[j] == 0)
                a[i].weizhi[j] = 0;
            else
                a[i].weizhi[j] = (a[i].b[j]-avg[j])/temp[j];
    for (int i = 1;i <= n;i++)
    {
        double temp = 0,temp1 = 0;
        for (int j = 1;j <= 3;j++)
            temp += a[i].weizhi[j];
        for (int j = 4;j <= 8;j++)
            temp1+=a[i].weizhi[j];
        temp1*=0.8;
        a[i].zongweizhi = temp+temp1;
    }
    sort(a+1,a+1+n,cmp);
    for (int i= 1;i <= n;i++)
        printf("%d\n",a[i].bianhao);
    return 0;
}

C++(clang++11) 解法, 执行用时: 4ms, 内存消耗: 376K, 提交时间: 2020-12-15 17:16:41

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

double avg[8];
double sumavg[8];

struct Player {
	int index;
	int x[8];
	int sumx;
	double sumy;
	friend bool operator<(const Player &a, const Player &b) {
		return a.sumy > b.sumy || (a.sumy == b.sumy && a.sumx > b.sumx);
	}
} player[1000];

int main() {
	int n; scanf("%d", &n);
	for(int i = 0; i < n; ++i) {
		Player &p = player[i];
		p.index = i + 1;
		for(int j = 0; j < 8; ++j) {
			scanf("%d", &p.x[j]);
			p.sumx += p.x[j];
			avg[j] += p.x[j];
		}
	}
	for(int j = 0; j < 8; ++j) {
		avg[j] /= n;
		for(int i = 0; i < n; ++i)
			sumavg[j] += fabs(player[i].x[j] - avg[j]);
		sumavg[j] /= n;
	}
	for(int i = 0; i < n; ++i) {
		Player &p = player[i];
		for(int j = 0; j < 8; ++j) {
			double y = 0;
			if(sumavg[j] != 0) y = (p.x[j] - avg[j]) / sumavg[j];
			if(j >= 3) y *= 0.8;
			p.sumy += y;
		}
	}
	stable_sort(player, player + n);
	for(int i = 0; i < n; ++i)
		printf("%d\n", player[i].index);
	return 0;
}