Submission #7215390

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s;cin>>s;
    int k; cin>>k;
    int l = s.size();
    vector<string> top;
    for(int i=0; i<l; i++){
        for(int j=i; j<l&&j<i+k; j++){
            string st = s.substr(i,j-i+1);
            bool flag = true;
            for(string a:top)flag&=(a!=st);
            if(flag){
                top.push_back(st);
                sort(top.begin(),top.end());
                if(top.size()==k+1) top.resize(k);
            }
        }
    }
    cout<<top[k-1]<<endl;
    return 0;
}

Submission Info

Judge Result