离散化

#include<bits/stdc++.h>
using namespace std;
int a[1000];
int tmp[1000];
int ans[1000];
int n;
int Getid(int x)
{
	return lower_bound(tmp, tmp + n, x) - tmp+1;
}
int main()
{
	cin >> n;
	for (int i = 0; i < n; ++i) { cin>>a[i], tmp[i] = a[i]; }
	sort(tmp, tmp + n); int k = unique(tmp, tmp + n)-tmp;
	for (int i = 0; i < n; ++i) {
		ans[i] = Getid(a[i]);
		//cout << ans[i] << " ";
	}
			
}