Submission #4071485

---

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);
        }
    }
    int count = 0;
    string prev = "";
    while(1){
        if(que.top() == prev){
            que.pop();
            continue;
        }count++;
        if(count == k){
            cout<<que.top()<<endl;
            break;
        }
        prev = que.top();
        que.pop();
    }
    return 0;
}

Submission Info

Judge Result