10分求调

#include<bits/stdc++.h>
using namespace std;
int g[200005];
int s[200005];
int b[200005];
int g1[200005];
int s1[200005];
int b1[200005];
int main(){
	int n;
	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);
	sort(s1+1,s1+n+1);
	sort(b1+1,b1+n+1);
	for(int i=1;i<=n;i++){
		int ming=n-(upper_bound(g1+1,g1+n+1,g[i])-g1)+2;
		int mins=n-(upper_bound(s1+1,s1+n+1,s[i])-s1)+2;
		int minb=n-(upper_bound(b1+1,b1+n+1,b[i])-b1)+2;
		//cout<<ming<<" "<<mins<<" "<<minb<<endl;
		cout<<min(ming,(mins,minb))<<endl;
	}
}