Submission #2561002

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

int main(){
	string s; int K;
	while(cin >> s >> K){
		vector<string> vs;
		for(int i=0;i<s.size();i++){
			for(int j=1;j<=K;j++){
				if(i+j > s.size()) break;
				vs.push_back(s.substr(i, j));
			}
		}
		sort(vs.begin(), vs.end());
		vs.erase(unique(vs.begin(), vs.end()), vs.end());
		cout << vs[K-1] << endl;
	}
}

Submission Info

Judge Result