题解 | 名字的漂亮度

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int main() {
    vector<int> vec;
    int n;
    cin >> n;
    string str;
    while (n--) {
        cin >> str;
        map<char, int> m;
        for (auto elem : str) {
            m[elem]++;
        }
        for (auto [k, v] : m) {
            vec.push_back(v);
        }
        sort(vec.begin(), vec.end(), std::greater<int>());
        int len = vec.size();
        long long res = 0;
        for (int i = 0; i < len; ++i)    res += vec[i] * (26 - i);
        cout << res << endl;
        vec.clear();
        m.clear();
    }


    return 0;
}