Submission #175235

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int check(string s,string sb,int times){
	times++;
	
	for(int i=0;i<s.size();i++){
	if(s[i]!=sb[i])
	times--;
	}
	return times>0;
}
int main() {
	// your code goes here
	bool changed[100]={};
	int N,K,oked=0;
	string s,ans;
	vector<char> sss,changer;
	cin >> N>> K;
	cin >> s;
	ans=s;
	for(int i=0;i<s.size();i++){
		int maxim=i;
		for(int j=i;j<s.size();j++)
			if(ans[maxim]>ans[j])
				maxim = j;
		swap(ans[i],ans[maxim]);
		if(!check(ans,s,K)){
		swap(ans[i],ans[maxim]);
		oked=i;
		break;
		}
		else
		changed[maxim]=true;
		changed[i] =true;
	}
	for(int i=oked;i<s.size();i++){
		int maxim=i;
		if(changed[oked]==true)
		for(int j=i;j<s.size();j++)
			if(s[i]==s[j])
				maxim = j;
		swap(ans[i],ans[maxim]);
		if(!check(ans,s,K)){
		swap(ans[i],ans[maxim]);
		break;
		}
		else{
		changed[i] = false;
		
		changed[maxim]=true;
		}
	}
	for(int i=0;i<s.size();i++){
		int maxim=i;
		for(int j=i;j<s.size();j++)
			if(ans[maxim]>ans[j] && ((changed[maxim] && changed[j])))
				maxim = j;
		swap(ans[i],ans[maxim]);
		if(!check(ans,s,K)){
		swap(ans[i],ans[maxim]);
		break;
		}
		else
		changed[maxim]=true;
	}
	cout << ans   <<  endl;
	return 0;
}

Submission Info

Judge Result