其余超时

#include<bits/stdc++.h>
using namespace std;
const int maxn=2*1e5+5;
int n,g1[maxn],s1[maxn],b1[maxn];
int g[maxn],s[maxn],b[maxn],ans[maxn];
bool cmp(int A,int B){
    return A>B;
}
int main(){
    cin>>n;
	for(int i=1;i<=n;i++){
    	cin>>g[i]>>s[i]>>b[i];
        g1[i]=g[i];
        s1[i]=s[i];
        b1[i]=b[i];
    }sort(g1+1,g1+n+1,cmp);
    sort(s1+1,s1+n+1,cmp);
    sort(b1+1,b1+n+1,cmp);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
            if(g[i]==g1[j]||s[i]==s1[j]||b[i]==b1[j]){
                cout<<j<<endl;
                break;
            }
        }
    }
	return 0;
}