3021. 字符排序

void solve() {
    vector<char*> alpha;
    string line;
    getline(cin, line);
    for (auto &e : line)
        if (isalpha(e))
            alpha.push_back(&e);
    for (int i = 0; i < alpha.size(); i++)
        for (int j = i+1; j < alpha.size(); j++)
            if (*alpha[i] > *alpha[j])
                swap(*alpha[i], *alpha[j]);
    cout << line << endl;
}

string str; getline(cin, str);
vector<char> vec;
for (auto ch : str)
        if (isupper(ch))
                vec.push_back(ch);
sort(vec.begin(), vec.end());
uint32_t i = 0;
for (auto ch : str)
    putchar(isupper(ch) ? vec[i++] : ch);
putchar('\n');

#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    string str,word;
    int n,i,j,k;
    cin>>n;
    getchar();
    for(i=0;i<n;i++){
        getline(cin,str);
        for(j=0;j<str.size();j++){
            if(str[j]>='A'&&str[j]<='Z'){
                word.insert(word.end(),str[j]);
                str[j]='*';
            }
        }
        sort(word.begin(),word.end());
        k=0;
        for(j=0;j<str.size();j++){
            if(str[j]=='*'){
                str[j]=word[k];
                k++;
            }
        }
        printf("case #%d:\n",i);
        cout<<str<<endl;
        str.clear();
        word.clear();
    }
    return 0;
}