Submission #1779411

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
string po(string s, int k, bool* used){
	if(!k) return s;
	if(s.size() == 1) return s;
	if(k == 1 && !used[0]){
		int pos = 0;
		for(int i = 1; i < s.size(); ++i){
			if(s[pos] > s[i] && used[i]) pos = i;
		}
		if(pos){
			char temp = s[pos];
			s[pos] = s[0];
			s[0] = temp;
			return s;
		}else{
			return s[0] + po(s.substr(1, s.size() - 1), k, used + 1);
		}
	}
	int pos = 0;
	for(int i = 1; i < s.size(); ++i){
		if(s[pos] > s[i] || (s[pos] == s[i] && used[i] && !used[pos])) pos = i;
	}
	int dec;
	if(pos){
		char temp = s[pos];
		s[pos] = s[0];
		s[0] = temp;
		dec = !used[0] + !used[pos];
		used[0] = used[pos] = 1;
	}
	return s[0] + po(s.substr(1, s.size() - 1), k - (pos ? dec : 0), used + 1);
}
int main(){
	int n, k; cin >> n >> k;
	string s; cin >> s;
	bool used[n];
	for(int i = 0; i < n; ++i) used[i] = 0;
	cout << po(s, k, used) << endl;
	return 0;
}

Submission Info

Judge Result