离散化为什么不对呢？

#include<bits/stdc++.h>
using namespace std;
int n,au[200005],ag[200005],cu[200005],numau[200005],numag[200005],numcu[200005];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) 
		cin>>au[i]>>ag[i]>>cu[i],
		numau[i]=au[i],numag[i]=ag[i],numcu[i]=cu[i];
	sort(numau+1,numau+1+n);
	sort(numag+1,numag+1+n);
	sort(numcu+1,numcu+1+n);
	for(int i=1;i<=n;i++)
		au[i]=n-(lower_bound(numau+1,numau+1+n,au[i])-numau)+1,
		ag[i]=n-(lower_bound(numag+1,numag+1+n,ag[i])-numag)+1,
		cu[i]=n-(lower_bound(numcu+1,numcu+1+n,cu[i])-numcu)+1,
		cout<<min(au[i],min(ag[i],cu[i]))<<"\n";
	return 0;
}