BOJ 18870 TE answer

18870.cpp

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;
using ull = long long int;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;

    vector<int> a(n);

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    set<int> s(a.begin(), a.end());

    for (auto &i: a) {
        auto it = lower_bound(s.begin(), s.end(), i);
        cout << distance(s.begin(), it) << " ";
    }
    cout << "\n";

    return 0;
}