[백준] 18870 - 좌표 압축(설명X)

#include <cstdio>
#include <queue>
#include <unordered_map>
using namespace std;
 
int main() {
    int N;
    scanf("%d", &N);
    int* arr = new int[N];
    priority_queue<int, vector<int>, greater<int>> pQueue;
    unordered_map<int, int> uMap;
    for (int i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
        pQueue.push(arr[i]);
    }
    for (int i = 0; pQueue.size() > 0; pQueue.pop()) {
        if (uMap.find(pQueue.top()) == uMap.end()) {
            uMap.insert({ pQueue.top(), i });
            i++;
        }
    }
    for (int i = 0; i < N; i++)
        printf("%d ", uMap.find(arr[i])->second);
}