51Nod完美字符串

题目信息

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int cmp(int x,int y)
{
	return x>y;
}
int main()
{
	int a[26];
	string str;
	while(cin>>str)
	{
		memset(a,0,sizeof(a));
		for(int i=0;i<str.length();i++)
		{
			if(str[i]>='a'&&str[i]<='z')
			 a[str[i]-'a']++;
			else 
			  a[str[i]-'A']++;
		}
		sort(a,a+26,cmp);
		int cnt=26,ans=0;
		for(int i=0;i<26;i++)
		{
			if(a[i]>=0)
			{
				ans+=(cnt*a[i]);
				cnt--;
			}
			if(a[i]==0)
			break;
		}
		cout<<ans<<endl;
	}
}