30分，帮忙调一下

#include<bits/stdc++.h>
using namespace std;
int n,b[10010];
struct STU{
	int total;
	int mat;
	int eng;
	int chi;
	int id;
	int mctotal;
	int mcmax;
}a[10010];
bool cmp(STU x, STU y) {
	if(x.total != y.total) return x.total > y.total;
	if(x.mctotal != y.mctotal) return x.mctotal > y.mctotal;
	return x.mcmax > y.mcmax;
}
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++) {
		cin >> a[i].chi >> a[i].mat >> a[i].eng;
		a[i].total = a[i].chi + a[i].mat + a[i].eng;
		a[i].mctotal = a[i].mat + a[i].chi;
		a[i].mcmax = max(a[i].mat, a[i].chi);
		a[i].id = i;
	}
	sort(a + 1, a + 1 + n,cmp);
	int u = 1;
	int j = 1;
	b[a[1].id] = u;
	for(int i = 2;i <= n;i++){
		if(a[i].total != a[i - 1].total || a[i].mcmax != a[i - 1].mcmax || a[i].mctotal != a[i - 1].mctotal) {
			b[a[i].id] = u + j;
			j = 1;
			u += j;
		}
		else {
			j++;
			b[a[i].id] = u;
		}
	}
	for(int i = 1;i <= n;i++) {
		cout << b[i] << endl;
	}
	return 0;
}