题解 | #字符串排序#

#include <cctype>
#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

bool cmp(char a, char b) {
    return tolower(a) < tolower(b);
}

int main() {
    string s;
    string ts = "";

    getline(cin, s);

    for (auto c : s) {
        if (isalpha(c)) ts += c;
    }

    stable_sort(ts.begin(), ts.end(), cmp);
    
    int pos = 0;
    for (auto c : s) {
        if (!isalpha(c)) cout << c;
        else cout << ts[pos++];
    }

    return 0;
}