Submission #4028030

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
 
const int INF = 1e9;
const int mod = 1e9+7;
 
int main()
{
    int n;
    cin >> n;
    vector<int> a(n),b;
    for(int i = 0; i < n; i++) cin >> a[i];
    b = a;
    sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());
    for(int i = 0; i < n; i++){
        cout << lower_bound(b.begin(),b.end(),a[i])-b.begin() << endl;
    }
    return 0;
}

Submission Info

Judge Result