题解 | 名字的漂亮度

#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> mm;

int f(string s){
    vector<char> vec;
    //map<char, int> m;
    for(char c : s){
        if(mm.find(c) != mm.end()){
            mm[c]++;
            continue;
        }
        vec.push_back(c);
        mm[c] = 1;
    }
    auto lmda = [](char c1, char c2){return mm[c1] > mm[c2];};
    sort(vec.begin(), vec.end(), lmda);
    int t = 26;
    int sum = 0;
    for(char c : vec){
        sum += mm[c] * t;
        t--;
    }
    mm.clear();
    return sum;
    
}

int main() {
    int n;
    string s;
    cin >> n;
    while(n--){
        cin >> s;
        cout << f(s) << endl;

    }
}
// 64 位输出请用 printf("%lld")