Submission #2606056

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<ctime>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++i)
using namespace std;


string s;
int k;
const int MAXN = 50000;
const int MAXK = 6;
string x[MAXK], sx;


int main() {
	cin >> s >> k;
	rep(i, 0, s.length() - 1) {
		rep(j, i, min(i + 6, (int)s.length() - 1)) {
			sx.clear();
			sx = s.substr(i, j - i + 1);
			bool tf = 1;
			rep(i, 1, k) {
				if (x[i] == sx) tf = 0;
			}
			if (tf && sx < x[k] || x[k].length() <= 0) {
				int kx = k;
				while (x[kx].empty() && kx > 1) --kx;
				if (!x[kx].empty() && kx < k) ++kx;
				x[kx] = sx;
				sort(x + 1, x + 1 + kx);
			}
		}
	}
	cout << x[k] << "\n";
	return 0;
} 

Submission Info

Judge Result