Submission #2383078

---

Source Code Expand

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

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N, K;
  cin >> N >> K;
  string s;
  cin >> s;
  bool used[N];
  memset(used, false, sizeof(used));

  for(int i=0;i<N;i++) {
    char c;
    int idx = -1;
    for(int j=i+1;j<N;j++) {
      if(K - (2 - used[i] - used[j]) < 0) continue;
      if(idx < 0 || s[j] < c) {
        c = s[j];
        idx = j;
      }
    }

    if(idx < 0) continue;
    if(s[i] > s[idx]) {
      swap(s[i], s[idx]);
      K -= (2-used[i]-used[idx]);

      used[i] = true;
      used[idx] = true;
    }
    //cout << K << endl;

  }
  cout << s << endl;

  return 0;

}

Submission Info

Judge Result