[知识点]离散化

#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
#define pos(i,a,b) for(int i=(a);i<=(b);i++)
#define N 100
int n,b[N];
vector<int> a;
int my_find(int x){
	return lower_bound(a.begin(),a.end(),x)-a.begin()+1;//找到x是第几个 
}
int main(){
	cin>>n;
	pos(i,1,n){
		cin>>b[i];a.push_back(b[i]);
	} 
	sort(a.begin(),a.end());//排序 
	a.erase(unique(a.begin(),a.end()),a.end());//去重之后从vector中清除 
	pos(i,1,n){
		cout<<my_find(b[i])<<" ";
	}
	return 0;
}