#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
int T = 0;
struct Conquest
{
int num;
char s[80];
}str[2005];
int cmp(struct Conquest a,struct Conquest b)//自己写一个排序参数
{
int a_len = strlen(a.s);
int b_len = strlen(b.s);
for(int i = 0; a.s[i]!='\0'||b.s[i]!='\0'; i++)
{
if(a.s[i]<b.s[i])return 1;
else if(a.s[i]>b.s[i]) return 0;
}
if(a_len <= b_len)return 1;
else return 0;
}
int main()
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif // LOCAL
int n,i;
scanf("%d",&n);
while(n--)
{
char contry[80],name[80];
scanf("%s",contry);
getchar();
gets(name);
if(T == 0)
{
strcpy(str[T].s,contry);
str[0].num++;
T++;
}
else
for(i = 0; i < T ; i++)
{
if(strcmp(str[i].s,contry)==0)
{str[i].num++;break;}
}
if(i == T)
{
strcpy(str[T].s,contry);
str[T].num++;
T++;
}
}
if(T == 1)printf("%s %d\n",str[0].s,str[0].num);
else
{
sort(str,str+T,cmp);
for(i = 0; i < T; i++)
{
printf("%s %d\n",str[i].s,str[i].num);
}
}
return 0;
}
uva 10420 - List of Conquests
最新推荐文章于 2016-09-22 20:10:14 发布