Submission #3923271

---

Source Code Expand

//inlclude before define 
#define _USE_MATH_DEFINES

//include
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<assert.h>
#include<deque>
#include<iomanip>
#include<set>
#include<tuple>
#include<map>

using namespace std;

//typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef pair<int, int> P1;
typedef long long int ll;

//define
#define INF 1e9
#define NUM 1000000007
#define all(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))

//function

/*ll gcd(ll a, ll b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}*/

/*ll lcm(ll a,ll b) {
	ll g = gcd(a, b);
	return a * (b / g);
}*/

/*int dig(int a) {
	int sum = 0;
	while (a) {
		sum += a % 10;
		a /= 10;
	}
	return sum;
}*/

int main() {
	string s;
	int n;
	cin >> s >> n;
	VS str;
	int cnt = 0,beg=0;
	for (int i = 1; i <= s.size(); i++) {
		for (int j = 0; j < s.size() - i+1; j++) {
			str.push_back(s.substr(j,i));
			cnt++;
		}
		sort(str.begin() + beg, str.begin() + cnt);
		beg = cnt;
	}

	/*rep(i, cnt) {
		cout << str[i] << endl;
	}*/
	//cout << cnt << endl;
	string mem=str[0];
	if (cnt-n == 1) {
		cout << mem << endl;
		return 0;
	}
	
	int ans = 1;
	REP(i, 1, cnt) {
		if (mem != str[i]) {
			mem = str[i];
			ans++;
		}
		if (ans == cnt-n) {
			cout << mem << endl;
			return 0;
		}
	}
}

Submission Info

Judge Result