Submission #8383656

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;

int main(){
    string s; cin >> s;
    int k; cin >> k; //k番目は高々k文字
    vector<string> sub;
    REP(i, s.length()){
        for(int j = 1; j <= k && i+j <= s.length(); j++){
            sub.push_back(s.substr(i, j));
        }
    }
    
    sort(sub.begin(), sub.end());
    sub.erase(unique(sub.begin(), sub.end()), sub.end());
    cout << sub[k-1] << endl;
    return 0;
}

Submission Info

Judge Result