Submission #4070324

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main()
{
    string s;
    int K;
    vector<string> substrings;

    cin >> s >> K;
    for(int i = 0; i < s.size(); ++i) {
        for(int j = 1; j <= s.size(); ++j) {
            substrings.push_back(s.substr(i, j));
        }
    }
    sort(substrings.begin(), substrings.end());
    substrings.erase(unique(substrings.begin(), substrings.end()), substrings.end());
//    for(auto hoge : substrings) cout << hoge << endl;
    cout << substrings[K - 1] << endl;
    return 0;
}

Submission Info

Judge Result