2896. 随机排序

#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
const int maxn = 1e5+5;

string arr[maxn];
string order;

bool cmp(string a,string b){
    for (int i = 0; i < min(a.length(),b.length()); ++i) {
        char t1 = toupper(a[i]);
        char t2 = toupper(b[i]);
        if (order.find(t1) == order.find(t2)) continue;
        return order.find(t1) < order.find(t2);
    }
    return a.length()<b.length();
}

int main() {
    string temp;
    while(cin>>order){
        getchar();
        getline(cin,temp);
        istringstream ss(temp);
        int n=0;
        while(ss >> arr[n]){
            n++;
        }
        sort(arr,arr+n,cmp);
        for (int i = 0; i < n; ++i) {
            cout<<arr[i];
            if (i!=n-1) cout<<" ";
            else cout<<endl;
        }
    }
    return 0;
}

for(i=0; i<count-1; i++)
        printf("%s ",a[i]);
    printf("%s\n",a[i]);
}

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

int main() {
    for (string order; cin >> order;) {
        unordered_map<char, char> weight;
        for (char i = 0, sz = (char)order.size(); i != sz; ++i) {
            weight.insert({ order[i], i });
        }
        cin.get();
        string text;
        getline(cin, text);
        istringstream in(text);
        struct Rec {
            string text;
            string sort_key;
        };
        vector<Rec> strs;
        for (Rec temp; in >> temp.text;) {
            uint32_t sz = (uint32_t)temp.text.size();
            temp.sort_key.resize(sz);
            for (uint32_t i = 0; i < sz; ++i) {
                temp.sort_key[i] = weight.at((char)toupper(temp.text[i]));
            }
            strs.push_back(move(temp));
        }
        sort(strs.begin(), strs.end(), [](auto const& a, auto const& b) {
            return a.sort_key < b.sort_key;
            });
        printf("%s", strs.front().text.data());
        for (uint32_t i = 1, sz = (uint32_t)strs.size(); i != sz; ++i) {
            // safely assume sz >= 1;
            printf(" %s", strs[i].text.data());
        }
        putchar('\n');
    }
}