Submission #175241

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
 
int main() {
	int n,k;
	char a[109],w;
	string s,t;
	cin>>n>>k>>s;
	t=s;
	sort(&s[0],&s[s.size()]);
	for(int i=0;i<k;i++)a[i]=s[i];
	for(int j=0;j<k;j++){
		for(int i=0;i<n;i++)
			if(a[j]==t[i]){w=t[j];t[j]=t[i];t[i]=w;}
	cout<<t<<endl;
	}
	
	return 0;
}

Submission Info

Judge Result