题目链接:https://www.patest.cn/contests/pat-a-practise/1071
#include<bits/stdc++.h>
#define cle(n) memset(n,0,sizeof(n))
const int maxn =10100;
using namespace std;
map<string,int> q;
int main(){
string s;
string tt;int i,len;char c;
while(cin>>s){
tt="";
len=s.length();
for( i=0;i<len;i++){
c=s[i];
if(isalnum(c)||isalpha(c)){c=tolower(c);tt+=c;}
else{
if(tt!="")q[tt]++; tt="";
}
}
if(i==len&&tt!="")q[tt]++;
}
string ans,temps;
int num=0,temp;
map<string,int>::iterator it=q.begin();
for(;it!=q.end();it++){
temps=it->first;
temp=it->second;
if(temp>num){num=temp; ans=temps;}
else if(temp==num){
if(ans>temps)ans=temps;
}
}
cout<<ans<<' '<<num<<endl;
return 0;
}