Sortiranje

#include <bits/stdc++.h>
using namespace std;

map<char, int> vrd;

struct ime {
    string s;
    double v;
    ime(string _s) {
        s = _s;
        v = f();
    }
    double f() {
        double r = 0;
        for (int i = 0; i < s.length(); ++i) {
            r += vrd[s.at(i)];
        }
        r = r / s.length();
        return r;
    }
};

bool imeF(const ime &i1, const ime &i2) {
    return i1.v < i2.v;
}

int main() {
    {
        string s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
        for (int i = 0; i < 26; ++i) vrd[s.at(i)] = i+1;
    }
    int n; cin >> n;
    vector<ime> iminja;
    for (int i = 0; i < n; ++i) {
        string s; cin >> s;
        iminja.push_back(ime(s));
    }

    sort(iminja.begin(), iminja.end(), imeF);
    //
    for (int i = 0; i < iminja.size(); ++i) {
        cout << iminja[i].s << endl;
    }
}