Submission #2530265

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;

using namespace std;

int main(){
    int N;
    cin >> N;
    map<int, int> n;
    vector<int> b;
    for (int i = 0; i < N; i++){
	int a;
	cin >> a;
	n[a]++;
	b.push_back(a);
    }

    int cnt = 0;
    for (auto itr = n.begin(); itr != n.end(); itr++){
	itr->second = cnt;
	cnt++;
    }

    for (int i = 0; i < b.size(); i++){
	b[i] = n[b[i]];
    }

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

    return 0;
}

Submission Info

Judge Result