|
大小: 1104
备注:
|
大小: 759
备注:
|
| 删除的内容标记成这样。 | 加入的内容标记成这样。 |
| 行号 2: | 行号 2: |
| Time limit: 1 Seconds | http://acm.zju.edu.cn/show_problem.php?pid=2104 |
| 行号 4: | 行号 4: |
| Memory limit: 32768K | {{{#!cplusplus /*Written by czk*/ #include <iostream> #include <string> #include <map> #include <algorithm> using namespace std; |
| 行号 6: | 行号 12: |
| 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. |
bool less_map(map<string, int>::value_type v1, map<string, int>::value_type v2) { return v1.second < v2.second; } |
| 行号 9: | 行号 16: |
| == 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 }}} http://acm.zju.edu.cn/show_problem.php?pid=2104 ------ |
int main() { while (1) { int n; cin >> n; if (n==0) break; map<string, int> colors; for (int i = 0; i < n; i++) { string color; cin >> color; colors[color]++; //automatic insert (color,0) pair when key color doesn't exist } cout << max_element(colors.begin(), colors.end(), less_map)->first << endl; } }}}} |
Let the Balloon Rise
http://acm.zju.edu.cn/show_problem.php?pid=2104
1 /*Written by czk*/
2 #include <iostream>
3 #include <string>
4 #include <map>
5 #include <algorithm>
6 using namespace std;
7
8 bool less_map(map<string, int>::value_type v1, map<string, int>::value_type v2) {
9 return v1.second < v2.second;
10 }
11
12 int main() {
13 while (1) {
14 int n;
15 cin >> n;
16 if (n==0) break;
17 map<string, int> colors;
18 for (int i = 0; i < n; i++) {
19 string color;
20 cin >> color;
21 colors[color]++; //automatic insert (color,0) pair when key color doesn't exist
22 }
23 cout << max_element(colors.begin(), colors.end(), less_map)->first << endl;
24 }
}