Submission #4071450

---

Source Code Expand

#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
    string s; cin>>s;
    int k; cin>>k;
    priority_queue<string,vector<string>,greater<string>> que;
    for(int i=0;i<s.length();++i){
        string now = "";
        for(int j=i;j<s.length();++j){
            now += s[j];
            que.push(now);
        }
    }
    vector<string> list = vector<string>(que.size());
    for(int i=0;i<list.size();++i){
        list[i] = que.top();
        que.pop();
    }
    list.erase(unique(list.begin(),list.end()),list.end());
    cout<<list[k-1]<<endl;
    return 0;
}

Submission Info

Judge Result