题目

链接

https://www.luogu.com.cn/problem/CF43A

字面描述

题面翻译

题面描述

两只足球队比赛，现给你进球情况，问哪支队伍赢了。

第一行一个整数 $n$（$1\le n\le 100$），表示有 $n$ 次进球，接下来 $n$ 行，每行一个长度不超过 $10$，只由大写字母组成的字符串，表示一个进球的球队名，保证只有两个球队。

输出一个字符串表示胜利球队的球队名，不会平局。

题目描述

One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn’t find the overall score of the match; however, he got hold of a profound description of the match’s process. On the whole there are $ n $ lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.

输入格式

The first line contains an integer $ n $ ( $ 1<=n<=100 $ ) — the number of lines in the description. Then follow $ n $ lines — for each goal the names of the teams that scored it. The names are non-empty lines consisting of uppercase Latin letters whose lengths do not exceed 10 symbols. It is guaranteed that the match did not end in a tie and the description contains no more than two different teams.

输出格式

Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.

样例 #1

样例输入 #1

1
ABC

样例输出 #1

ABC

样例 #2

样例输入 #2

5
A
ABA
ABA
A
A

样例输出 #2

A

代码实现

map的一道基础操作模板题，（稍后会写map的数据结构介绍）

#include<bits/stdc++.h>
using namespace std;int t,cnt;
string a,ans;
map<string,int>mp;
map<string,int>::iterator it;
int main(){cin>>t;while(t--){cin>>a;mp[a]++;}for(it=mp.begin();it!=mp.end();it++){if(it->second > cnt){cnt=it->second;ans=it->first;}}cout<<ans<<endl;return 0;
}