Submission #1520857

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#define pb push_back
using namespace std;
typedef long long ll;

int main(void){
  int n,i,t;
  vector<int> a,b;
  map<int,int> mp,rmp;
  cin>>n;

  for(i=0;i<n;i++){
    cin>>t;
    a.pb(t);
    if(mp.find(t)!=mp.end()){
      mp[t]++;
    }
    else{
      mp[t]=1;
      b.pb(t);
    }
  }
  sort(b.begin(),b.end());

  for(i=0;i<b.size();i++){
    rmp[b[i]]=i;
  }
  for(i=0;i<a.size();i++){
    cout<<rmp[a[i]]<<endl;
  }

  return 0;
}

Submission Info

Judge Result