Submission #8430748

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) {return a * b / gcd(a, b);}   //最小公倍数

int main(){
    
    string s;
    cin>>s;
    int k;cin>>k;
    vector<string>sub;
    rep(i,s.length()){
        for(int j=1;j<=k&&i+j<=s.length();j++){
            sub.push_back(s.substr(i,j));
        }
    }

    sort(sub.begin(),sub.end());
    sub.erase(unique(sub.begin(),sub.end()),sub.end());
    cout<<sub[k-1]<<endl;
    return 0;
}

Submission Info

Judge Result