leetcode506 + Topk问题，默认是最大堆

https://leetcode.com/problems/relative-ranks/description/

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        int n = nums.size(), cnt = 1;
        vector<string> res(n);
        priority_queue<pair<int, int> > Q; //默认是最大堆，以first大小排序的
        for(int i=0; i<n; i++){
            Q.push({nums[i], i});
        }
        for(int i=0; i<n; i++){
            int idx = Q.top().second; Q.pop();
            if(cnt == 1) res[idx] = "Gold Medal";
            else if(cnt == 2) res[idx] = "Silver Medal";
            else if(cnt == 3) res[idx] = "Bronze Medal";
            else res[idx] = to_string(cnt);
            cnt += 1;
        }
        return res;
    }
};