7-14 新浪微博热门话题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
int n,ac,mx;
string s1;
bool isnum(char c)
{
	if(c>='0'&&c<='9')
	return 1;
	return 0;
}
bool isaph(char c)
{
	if(c>='a'&&c<='z'||c>='A'&&c<='Z')
	return 1;
	return 0;
} 
int main()
{
	string s;
	cin>>n;
	map<string,int>m;
	getchar();
	for(int i=1;i<=n;i++)
	{
		getline(cin,s);
		map<string,bool>m0;
		for(int j=0;j<s.size();j++)
		{
			if(s[j]=='#')
			{
				bool cmp1=0;
				string s0;
				for(int k=j+1;s[k]!='#';k++)
				{
					j=k+1;
					if(isnum(s[k]))
					{
						s0=s0+s[k];
						cmp1=1;
					}
					else
					if(isaph(s[k]))
					{
						if(s[k]>='a'&&!s0.size())
						s0=s0+(char)(s[k]-'a'+'A');
						else
						if(s[k]<='Z'&&s0.size())
						s0=s0+(char)(s[k]-'A'+'a');
						else
						s0=s0+s[k];
						cmp1=1;
					}
					else
					s0=s0+' ';
				}
				string s2;
				for(int k=0;k<s0.size();k++)
				if(s0[k]!=' ')
				s2=s2+s0[k];
				else{
					if(k+1<s0.size()&&s0[k+1]!=' ')
					s2=s2+s0[k];
				}
				if(!m0[s2])
				{
					m[s2]++;
					if(m[s2]==mx)
					{
						if(s2<s1)
						s1=s2;
						ac++;
					}
					m0[s2]=1;
				}	
				if(m[s2]>mx)
				{
					s1=s2;
					mx=m[s2];
					ac=1;
				}
			}
		}
	}
	cout<<s1<<endl<<mx<<endl;
	if(ac>1)
	printf("And %d more ...\n",ac-1); 
}