11-散列1 电话聊天狂人 (25 分)

/*
6
13005711862 13588625832
13505711862 13088625832
13588625832 18087925832
15005713862 13588625832
13005711862 15005713862
13005711862 15005713862
*/
#include<iostream>
#include<string>
#include<map>
using namespace std;
const int maxn = 100010;

map<string, int> mp;

void Input(string str)
{
    if (mp.find(str) == mp.end())
    {
        mp[str] = 1;
    }
    else
    {
        mp[str]++;
    }
}

int main()
{
    int n;
    cin >> n;
    
    string s1,s2;
    for (int i = 0; i < n; i++)
    {
        cin >> s1 >> s2;
        Input(s1);
        Input(s2);
    }
    
    map<string, int>::iterator it = mp.begin();
    int most_time = -1;
    int most_num = 0;
    string most_ID;
    for (it = mp.begin(); it != mp.end(); it++)
    {
        //cout << "it->second = " << it->second << endl;
        if (it->second > most_time)
        {
            most_time = it->second;
            most_ID = it->first;
            most_num = 1;
        }
        else if(it->second == most_time )
        {
            most_num++;
            if (most_ID > it->first)
            {
                most_ID = it->first;
            }
        }
    }
    
    if (1 == most_num)
    {
        cout << most_ID << most_time;
    }
    else
    {
        cout << most_ID << " "<< most_time << " "<< most_num;
    }

    return 0;
}