LeetCode-Relative_Ranks

题目：

Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".

Example 1:

Input: [5, 4, 3, 2, 1]
Output: ["Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"]
Explanation: The first three athletes got the top three highest scores, so they got "Gold Medal", "Silver Medal" and "Bronze Medal". 
For the left two athletes, you just need to output their relative ranks according to their scores.

Note:

1. N is a positive integer and won't exceed 10,000.
2. All the scores of athletes are guaranteed to be unique.

翻译：

给定N个运动员的分数，找到他们的相对排名，并且得分最高的三个人分别被奖励奖牌：”金牌“，”银牌“和”铜牌“。

例子 1:

输入: [5, 4, 3, 2, 1]
输出: ["金牌", "银牌", "铜牌", "4", "5"]
解释: 前三个运动员获得最高的三个得分，因此他们获得“金牌”，“银牌”，“铜牌”。对于后面的两名运动员，只需要根据他们的得分输出相对排名。

注意：

1. N 是一个正数并且不超过 10,000。
2. 所有运动员的得分都是独一无二的。

思路：

借助map映射的自动排序，首先将得分和数组下标进行映射存到map里，这时，map里的运动员得分已经排好序，然后，倒序扫描整个map（map按从小到大排序），得到相对排名。

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;

class Solution {
public:
	vector<string> findRelativeRanks(vector<int>& nums) {
		vector<string> res(nums.size(),"");
		map<int, int> m;
		int cnt = 1;
		for (int i = 0; i < nums.size(); i++) {
			m[nums[i]] = i;
		}
		for (auto it = m.rbegin(); it !=m.rend(); it++) {
			if (cnt==1)
				res[it->second]="Gold Medal";
			else if (cnt == 2)
				res[it->second] = "Silver Medal";
			else if (cnt == 3)
				res[it->second] = "Bronze Medal";
			else
				res[it->second] = to_string(cnt);
			cnt++;
		}
		return res;
	}
};

int main()
{
	Solution s;
	vector<int> nums = { 10,3,8,9,4 };
	vector<string> result;
	result = s.findRelativeRanks(nums);
	for (int i = 0; i < result.size(); i++) {
		cout << result[i] << " ";
	}
    return 0;
}