CF Gym 100500I Hall of Fame

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;

char str[5000];
int cnt[26];

bool cmp(int a,int  b) { return cnt[a]>cnt[b] || ( cnt[a] == cnt[b] && a > b ); }

int main()
{
    int T;
    scanf("%d",&T);getchar();
    for(int k = 1; k <= T; k++){
        memset(cnt,0,sizeof(cnt));
        while(~scanf("%s",str)&&(*str)!=‘*‘){
            int len = strlen(str);
            for(int i = 0; i < len; i++){
                char ch = str[i];
                if(‘a‘<=ch&&ch<=‘z‘){
                    cnt[ch-‘a‘]++;
                }else
                if(‘A‘<=ch&&ch<=‘Z‘){
                    cnt[ch-‘A‘]++;
                }
            }
        }
        int r[26];
        for(int i = 0; i < 26; i++) { r[i] = i; }
        sort(r,r+26,cmp);
        int sum = 0;
        for(int i = 0; i < 5; i++) {
            if(cnt[r[i]])
            sum += r[i];
        }
        printf("Case %d: %s\n",k,sum>62?"Effective":"Ineffective");
    }
    return 0;
}