Submission #67928806

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
using namespace std;

int main() {
    int N, K, X;
    cin >> N >> K >> X;
    X--;
    vector<string> S(N);
    for (int i = 0; i < N; i++) cin >> S[i];

    vector<string> T = {""};
    for (int i = 0 ; i < K; i++) {
        vector<string> tmp;
        tmp.reserve(100'000);
        for (auto&& t : T) {
            for (int j = 0; j < N; j++) {
                tmp.push_back(t + S[j]);
            }
        }

        swap(T, tmp);
    }

    sort(T.begin(), T.end());
    cout << T[X] << endl;

    // for (auto&& t : T)cout << t << ' ';
    // cout << endl;
    return 0;
}

Submission Info

Judge Result