Submission #432565

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>

using namespace std;

int main() {
	string s;
	int n;
	int is[5];
	cin >> s >> n;
	for (int i = 0; i < 5; i++)
		is[i] = s[i];
	sort(is, is + 5);
//	for (int i = 0; i < 5; i++)
//		cout << (char)is[i];
//	cout << endl;
	int cnt = 0;
	for (int i = 0; i < 5; i++)
		for (int j = 0; j < 5; j++) {
			if (++cnt == n) {
				cout << (char)is[i] << (char)is[j] << endl;
				break;
			}
		}
	return 0;
}

Submission Info

Judge Result