Submission #996739

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

const int MAXN = 100 + 5;

int n, k;
string s, d[MAXN][MAXN], INF;
bool vis[MAXN][MAXN];

string mx(string a, string b){
	if (a.size() > b.size())	return a;
	if (a.size() < b.size())	return b;
	return max(a, b);
}

string mn(string a, string b){
	if (a.size() > b.size())	return b;
	if (a.size() < b.size())	return a;
	return min(a, b);
}

string get(int cur, int rem){
	if (rem < 0)	return INF;
	if (cur == n)	return "";
	if (vis[cur][rem])	return d[cur][rem];
	vis[cur][rem] = 1;
	d[cur][rem] = INF;
	string temp;
	for (int i = cur; i < n; i++){
		temp += s[i];
		d[cur][rem] = mn(d[cur][rem], mx(temp, get(i + 1, rem-1)));
	}
	return d[cur][rem];
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> k >> s;	n = s.size();	k++;
	for (int i = 0; i < 110; i++)	INF += '9';
	cout << get(0, k) << "\n";
	return 0;
}

Submission Info

Judge Result