散列1 电话聊天狂人

题目：https://pintia.cn/problem-sets/1268384564738605056/problems/1294124786527993856
题解：https://blog.csdn.net/as14569852/article/details/75043537
代码：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
using namespace std;
int n;
int main(){
    cin>>n;
    map<string,int> mp;
    string s,s1;
    string hhhc;
    int maxn=0;
    for(int i=1;i<=n;++i){
        cin>>s>>s1;
        mp[s]++;
        mp[s1]++;
    }
    int tt;
    for(map<string,int>::iterator it=mp.begin();it!=mp.end();++it){
        if(it->second>maxn){
            hhhc=it->first;
            maxn=it->second;
        }
    }
    for(map<string,int>::iterator it=mp.begin();it!=mp.end();++it){
        if(it->second==maxn){
            tt++;
        }
    }
    cout<<hhhc<<" "<<maxn;
    if(tt>1) cout<<" "<<tt;
    return 0;
}//是不是很简单