Easy - Let the Balloon Rise（map的应用）

 代码转载而来，注释我自己添加的；

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.

#include<bits/stdc++.h>
using namespace std;
string s;
map<string, int>mp;

int main() {
	int n;
	while (cin >> n&&n) {
		//for循环读入数据
		for (int i = 0;i < n;i++) {
			cin >> s;
			//会自动读入到string数据类型，即first
			if (!mp.count(s)) 	mp[s] = 1;
			else  mp[s]++;
		}
		//循环遍历找出数据
		string maxs;
		int maxn = 0;
		for (auto it = mp.begin();it != mp.end();it++) {
			if (it->second > maxn) {
				maxn = it->second;//更新int类型最大值
				maxs = it->first;//更新string类型的最大值
			}
		}
		cout << maxs << endl;
		mp.clear();
	}
}

1.map容器适用于映射；即一个数据映射另一个数据，两种数据可以不同；

2.使用first和second进行区分；

3.并且迭代器使用也具有特点 ；it->second；如此指向正确的数据；

4.map的访问：mp[s]++；系统似乎会自动判别类型放入该有问的位置；如果s为string类型则放入first；