Submission #2504822

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
using namespace std;
int N;

string s;
set <string> ses;
int K;

int x=0;
int main(){
  cin >> s;
  cin >> K;
  K--;
  for(char c='a';c<='z';c++){
    vector<int> v;
    for(int i=0;i<s.length();i++){
      if(s[i]!=c) continue;
      string ss="";
      for(int j=i;j<s.length();j++){
	ss+=s[j];
	ses.insert(ss);
	if(ss.size()>K)break;
	//cout << ss << endl;
        
      }
      //cout << endl;
    }
    
    if(ses.size()>K){
      for(set<string>::iterator it=ses.begin();it!=ses.end();it++){

	if(x==K)  {
	  cout << *it<< endl;
	  return 0;
	}
	x++;
      }
    }
  }
 
 
    return 0;
}

Submission Info

Judge Result