Submission #1780295

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int po(string &a, string &b){
	int ret = 0;
	for(int i = 0; i < a.size(); ++i) ret += (a[i] != b[i]);
	return ret;
}
int main(){
	int n, k; cin >> n >> k;
	string s; cin >> s;
	string t = s;
	for(int i = 0; i < n; ++i){
		int pos = i;
		for(int j = i + 1; j < n; ++j){
			if(t[pos] > t[j]){
				string u = t;
				u[i] = t[j];
				u[j] = t[i];
				if(po(s, u) <= k) pos = j;
			}
		}
		char tmp = t[i];
		t[i] = t[pos];
		t[pos] = tmp;
	} 
	cout << t << endl;
	return 0;
}

Submission Info

Judge Result