Submission #5018092

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

//template<class T, size_t N> 
//size_t countof(const T (&array)[N]) { return N; }


int main() {
  string s;
  int K;

  cin >> s;
  cin >> K;

  string strong[K];
  string weak;

  for(int k=0; k<s.size(); k++){
    weak.push_back('z');
  }

  for(int k=0; k<K; k++){
    strong[k] = weak;
  }
  for(int i=0; i < s.size(); i++){
    string tmp="";
    for(int j=0; i+j < s.size(); j++){
      tmp.push_back(s[i+j]);
      //      cout <<i<<" "<< tmp << endl;
      int flag=0;
      for(int k=0; k<K; k++){
	if(strong[k] == tmp) flag=1;
      }
      if(flag==1) continue;
      //比較代入
      for(int k=0; k<K; k++){
	if(strong[k] > tmp){
	  //	  cout << strong[k] << ">" << tmp <<endl;
	  for(int l=K-1; l > k; l--){
	    strong[l] = strong[l-1];
	  }
	  strong[k] = tmp;
	  break;
	}
      }
    }
  }

  cout << strong[K-1] << endl;


}

Submission Info

Judge Result