leetcode-506：相对名次

输入：score = [5,4,3,2,1]
输出：["Gold Medal","Silver Medal","Bronze Medal","4","5"]
解释：名次为 [1st, 2nd, 3rd, 4th, 5th] 。

输入：score = [10,3,8,9,4]
输出：["Gold Medal","5","Bronze Medal","Silver Medal","4"]
解释：名次为 [1st, 5th, 3rd, 2nd, 4th] 。
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/relative-ranks
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& score) {
        vector<int> ranks(score.begin(),score.end());
        sort(ranks.begin(),ranks.end(),greater<int>());//从大到小排
        unordered_map<int,int> umap;//用map，记录每个分数对应的排名
        for(int i=0;i<ranks.size();i++){
            umap[ranks[i]]=i;
        }
        vector<string> res;
        for(int i=0;i<score.size();i++){//通过分数获得排名，然后加入到结果中
            int rank=umap[score[i]];
            if(rank==0){
                res.push_back("Gold Medal");
            }
            else if(rank==1){
                res.push_back("Silver Medal");
            }
            else if(rank==2){
                res.push_back("Bronze Medal");
            }
            else{
                res.push_back(to_string(rank+1));
            }
        }
        return res;
    }
};

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& score) {
        vector<pair<int,int>> vec;
        for(int i=0;i<score.size();i++){
            vec.push_back(pair<int,int>(score[i],i));
        }
        sort(vec.begin(),vec.end(),[](pair<int,int>&a,pair<int,int>&b){
            return a.first>b.first;
        });
        vector<pair<string,int>> tmp;
        for(int i=0;i<vec.size();i++){
            if(i==0){
                tmp.push_back(pair<string,int>("Gold Medal",vec[i].second));
            }
            else if(i==1){
                tmp.push_back(pair<string,int>("Silver Medal",vec[i].second));
            }
            else if(i==2){
                tmp.push_back(pair<string,int>("Bronze Medal",vec[i].second));
            }
            else{
                tmp.push_back(pair<string,int>(to_string(i+1),vec[i].second));
            }
        }
        sort(tmp.begin(),tmp.end(),[](pair<string,int>&a,pair<string,int>&b){
            return a.second<b.second;
        });
        vector<string> res;
        for(pair<string,int> it:tmp){
            res.push_back(it.first);
        }
        return res;
    }
};