Submission #1304941

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define first  fs
#define second se
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)

using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;

const int inf = 1001001001;
const lint linf = 1001001001001001001ll;
const int mod = 1e9 + 7;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};

template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } return a > b; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } return a < b; }
template<typename T> inline void print(const T &x, char s = '\n') { cout << x << s; }
template<typename T> inline void print(const vector<T> &v, string s = " ") 
{ rep(i, v.size()) cout << v[i] << (i + 1 == v.size() ? "\n" : s); }
inline bool inside(int y, int x, int H, int W) { return 0 <= y && y < H && 0 <= x && x < W; }
inline lint in() { lint x; std::cin>>x; return x; }

int main() {
	int n = in(), k = in();
	string s, v, ans;

	cin >> s;
	v = ans = s;

	sort(all(v));

	for (int i = 0; i < n; ++i) {	
		if (ans[i] == v[i]) continue;

		int next;
		for (int j = n - 1; j >= i; --j) {
			if (ans[j] == v[i]) {
				next = j;
				break;
			}
		}

		swap(ans[i], ans[next]);

		int cnt = 0;
		rep(i, n) {
			if (ans[i] != s[i]) cnt++;
		}

		if (cnt > k) {
			swap(ans[i], ans[next]);
			break;
		}
//		print(i, ':');
//		print(ans);
	}

	cout << ans << endl;
}

Submission Info

Judge Result