Submission #64321868

---

Source Code Expand

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#ifdef LOCAL
#include "debugging_jinish.h"
#else
#define dbg(...) 1
#endif
 
template <typename num_t>
using ordered_set = tree<num_t, null_type, less<num_t>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double

void solve(){

    int n; cin >> n;
    int ar[n],copy[n];
    map<int,int> mp,mp2;
    for(int i=0; i<n; i++){
        cin >> ar[i];
        copy[i] = ar[i];
        mp[ar[i]]++;
    }
    int r = 1;
    sort(copy,copy+n);
    set<int> s;
    for(int i=n-1; ~i; i--){
        if(s.count(copy[i])) continue;
        mp2[copy[i]] = r;
        r += mp[copy[i]];
        s.insert(copy[i]);
    }

    for(int i=0; i<n; i++){
        cout << mp2[ar[i]] << "\n";
    }
}

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  
       solve();

  return 0;
}

Submission Info

Judge Result