1182 完美字符串

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char ch[10100];
struct str     //顺便把字符也记录下来了 ; 
{
    char ch;
    int cnt;
} number[100];
bool cmp(str a, str b)
{
    return a.cnt >b.cnt;
} 
int main()
{
    while(gets(ch))
    {
        int len= strlen(ch);
        sort(ch, ch+len);
        char cord= ch[0]; 
        int cnt= 0;
        int cntNum=1;
        for(int i=1; i<=len; i++)
        {
            if(ch[i]== ch[i-1])
                cntNum++;
            if(ch[i] !=ch[i-1])
            {
                number[cnt].ch= cord;
                number[cnt].cnt=cntNum;
                cntNum=1;
                cord= ch[i]; 
                cnt++;
            }
        }
        sort(number, number+ cnt, cmp);
        int rec =0;
        int init=26;
        for(int i=0; i< cnt; i++)
        {
            rec+= init* number[i].cnt;
            init--;
        } 
        printf("%d\n", rec);
        
    }
    return 0;
}