Submission #2579633

---

Source Code Expand

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

int main(){
  vector<int> v;
  set<int> s;
  int n; cin >> n;
  for (int i = 0; i < n; i++){
    int c; cin >> c;
    s.insert(c);
    v.push_back(c);
  }
  map<int, int> m;
  int comp = 0;
  for (set<int>::iterator it = s.begin(); it != s.end(); it++){
    m.insert(make_pair(*it, comp));
    comp++;
  }
  for (int i = 0; i < n; i++){
    cout << m[v[i]] << endl;
  }
  return 0;
}

Submission Info

Judge Result