LeetCode 506 相对名次[排序] HERODING的LeetCode之路

解题思路：
解决该题的关键就是要让得分与序号形成映射关系，用pair放入vector容器中，直接排序，最后按照排序结果给出获奖情况，代码如下：

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& score) {
        int n = score.size();
        string desc[3] = {"Gold Medal", "Silver Medal", "Bronze Medal"};
        vector<pair<int, int>> arr;
        for (int i = 0; i < n; i ++) {
            arr.push_back({-score[i], i});
        }
        sort(arr.begin(), arr.end());
        vector<string> ans(n);
        for (int i = 0; i < n; ++i) {
            if (i >= 3) {
                ans[arr[i].second] = to_string(i + 1);
            } else {
                ans[arr[i].second] = desc[i];
            }
        }
        return ans;
    }
};