题解 | 字符串排序

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

struct word {
    string s;
};

vector<int> customRank(26);  // 修改变量名

bool compare(const word& a, const word& b) {
    const string& s = a.s;
    const string& t = b.s;

    int lens = s.size();
    int lent = t.size();
    int minlen = min(lens, lent);

    for (int i = 0; i < minlen; i++) {
        int ranks = customRank[s[i] - 'a']; 
        int rankt = customRank[t[i] - 'a']; 

        if (ranks != rankt) {
            return ranks < rankt;
        }
    }
    return lens < lent;
}

int main() {
    string s2;
    cin >> s2;
    for (int i = 0; i < 26; i++) {
        customRank[s2[i] - 'a'] = i; 
    }
    int n;
    cin >> n;

    vector<word> words(n);
    for (int i = 0; i < n; i++) {
        cin >> words[i].s;
    }
    sort(words.begin(), words.end(), compare);

    for (const auto& word : words) {
        cout << word.s << endl;
    }
    return 0;
}