leetcode

0 class Solution {

1 public:

2 vector<int> arrayRankTransform(const vector<int> &arr) const {

3 const int n = size(arr);

4 vector<pair<int, int>> vec(n);

5 vector<int> ans(n);

6

7 for (int i = 0; int x : arr)

8 vec[i++] = {x, i};

9 sort(begin(vec), end(vec));

10

11 int curr = 0, prev = INT_MIN;

12 for (const auto &[x, i] : vec) {

13 if (x > prev) curr++;

14 ans[i] = curr;

15 prev = x;

16 }

17

18 return ans;

19 }

20 };