Submission #2502183

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#ifdef VC
#define scanf scanf_s
#endif
#define iINF (1<<30)
#define INF (1LL<<59)
#define forn(i) for(int i = 0;i < n; ++i)
#define form(i,n) for(int i = 0 ;i < n; ++i)
#define NIL -1

const int mod = 1e9 + 7;
int n;
int m;
string s;
string as[5];

int main() {
	cin >> s;
	int k;
	cin >> k;
	form(i, k) {
		as[i] = "}";
	}
	for (int i = 0; i < s.length(); i++) {
		for (int j = i; j < min((int)s.length(), i+5); j++) {
			form(l, k) {
				string temp;
				temp = s.substr(i, j - i + 1);
				if (temp < as[l]) {
					for (int p = k - 1; p > l; p--) {
						as[p] = as[p - 1];
					}
					as[l] = temp;
					break;
				}
				else if (temp == as[l])break;
			}
		}
	}
	cout << as[k - 1] << endl;
	return 0;
}

Submission Info

Judge Result