Submission #71315099

---

Source Code Expand

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

string fse(vector<string>& strings) {
    int n = strings.size();
    sort(strings.begin(), strings.end());
    bool allSame = true;
    for (int i = 1; i < n; i++) {
        if (strings[i] != strings[i + 1]) {
            allSame = false;
            break;
        }
    }
    
    if (allSame) {
        swap(strings[0], strings[1]);
        string result;
        for (const auto& s : strings) {
            result += s;
        }
        return result;
    }
    vector<string> original = strings;
    vector<string> candidate1 = strings;
    swap(candidate1[n-1], candidate1[n-2]);
    string originalConcatenated;
    for (const auto& s : strings) {
        originalConcatenated += s;
    }
    
    string candidate1Concatenated;
    for (const auto& s : candidate1) {
        candidate1Concatenated += s;
    }
    
    if (candidate1Concatenated > originalConcatenated) {
        return candidate1Concatenated;
    }
    int i = n - 2;
    while (i >= 0 && strings[i] >= strings[i + 1]) {
        i--;
    }
    
    if (i >= 0) {
        int j = n - 1;
        while (strings[j] <= strings[i]) {
            j--;
        }
        swap(strings[i], strings[j]);
        reverse(strings.begin() + i + 1, strings.end());
        
        string result;
        for (const auto& s : strings) {
            result += s;
        }
        return result;
    }
    sort(strings.begin(), strings.end());
    swap(strings[0], strings[1]);
    string result;
    for (const auto& s : strings) {
        result += s;
    }
    return result;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int T;
    cin >> T;
    
    while (T--) {
        int N;
        cin >> N;
        vector<string> strings(N);
        
        for (int i = 0; i < N; i++) {
            cin >> strings[i];
        }
        
        string result = fse(strings);
        cout << result << "\n";
    }
    
    return 0;
}

Submission Info

Judge Result