hdu Problem-1004(map+sort)

最新推荐文章于 2020-10-09 21:46:26 发布

原创最新推荐文章于 2020-10-09 21:46:26 发布 · 361 阅读

0 ·

CC 4.0 BY-SA版权

ACM-STL的使用专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个比赛场景下统计最热门问题对应的气球颜色的算法挑战。通过使用C++中的map来记录每种颜色气球的数量，并利用vector结合自定义排序方式找出出现次数最多的气球颜色。

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 121221 Accepted Submission(s): 47632

Problem Description

Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.

This year, they decide to leave this lovely job to you.

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.

A test case with N = 0 terminates the input and this test case is not to be processed.

Output

For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

Sample Input

5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output

red
pink

//思路：用map<string,int>记录数据，然后拷贝到vector中，再用sort排序即可

AC源码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

typedef pair<string,int> p;
bool cmp(const p& x,const p& y)
{
	return x.second>y.second;
}
int main()
{
	int n;
	while(cin>>n&&n)
	{
		map<string,int> mp;
		string str;
		int tmp=n;
		while(tmp--)
		{
			cin>>str;
			if(!mp.count(str))
				mp[str]=0;
			++mp[str];
		}
		vector<pair<string,int> > vec(mp.begin(),mp.end());
		sort(vec.begin(),vec.end(),cmp);
		cout<<vec[0].first<<endl;
	}
	return 0;
}