题解 | #字符串合并处理#

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

int main() {
    string str, str1, str2;
    cin >> str1 >> str2;
    str = str1 + str2;
    string sg, db;
    for (int i = 0; i < str.length(); i++) {
        if (i % 2 == 0) {
            db += str[i];
        } else if (i % 2 == 1) {
            sg += str[i];
        }
    }
    sort(sg.begin(), sg.end());
    sort(db.begin(), db.end());
    int j = 0;
    int k = 0;
    for (int i = 0; i < str.size(); i++) {
        if (i % 2 == 0) {
            str[i] = db[j];
            j++;
        } else if (i % 2 == 1) {
            str[i] = sg[k];
            k++;
        }
    }
    string Output = {"084C2A6E195D3B7F5D3B7F"};
    for (int i = 0; i < str.size(); i++) {
        if ((str[i] >= '0') && (str[i] <= '9')) {
            str[i] = Output[str[i] - '0'];
        } else if ((str[i] >= 'a') && (str[i] <= 'f')) {
            str[i] = Output[str[i] - 'a' + 10];
        } else if ((str[i] >= 'A') && (str[i] <= 'F')) {
            str[i] = Output[str[i] - 'A' + 16];
        }
    }
    cout << str << endl;
}