Submission #7671102

---

Source Code Expand

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

string solve() {
    string S;
    int K;
    cin >> S >> K;
    set<string> st;
    for ( int i = 0; i < S.size(); i++ ) {
        for ( int j = 1; i + j <= S.size(); j++ ) {
            if ( st.size() == K ) {
                if ( *prev(st.end()) <= S.substr(i, j) ) break;
            }
            st.insert(S.substr(i, j));
            if ( st.size() > K ) st.erase(prev(st.end()));
        }
    }
    return *prev(st.end());
}

int main() {
    auto ans = solve();
    cout << ans << "\n";
    return 0;
}

Submission Info

Judge Result