506. 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.

Subscribe to see which companies asked this question.


给每一个数一个排名,前三名是金银铜。这是排序的问题。将原序列的每个数的键值和值组成pair,然后按值从大到小排序。最后按顺序给排名就行了。


代码:

class Solution
{
public:
	vector<string> findRelativeRanks(vector<int>& nums)
	{
		vector<pair<int, int> > vec;
		vector<string> res(nums.size());
		string ranks[3] = {"Gold Medal", "Silver Medal", "Bronze Medal"};

		for(int i = 0; i < nums.size(); ++i) 
			vec.push_back(pair<int, int>(i, nums[i]));
		auto cmp = [](const pair<int, int>& p1, const pair<int, int>& p2) { return p1.second > p2.second; };
		sort(vec.begin(), vec.end(), cmp);

		for(int i = 0; i < nums.size(); ++i)
		{
			if(i < 3) res[vec[i].first] = ranks[i];
			else res[vec[i].first] = to_string(i+1);
		}
		return res;
	}
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值