[模板] - 离散化

#include <bits/stdc++.h>
#define pb push_back
using namespace std;

vector<int> id;

int getid(int x)
{
    return lower_bound(id.begin(), id.end(), x) - id.begin() + 1;
}

int main()
{
    int n;
    int m;

    scanf("%d", &n);
    for(int i = 1; i <= n; i ++){
        int x;

        scanf("%d", &x);
        id.pb(x);
    }
    sort(id.begin(), id.end());
    id.erase(unique(id.begin(), id.end()), id.end());
    scanf("%d", &m);
    printf("%d\n", getid(m));
}