Submission #4049520

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iomanip>

#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a); (b) <= i; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1)*(a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1<<29)

using namespace std;

#define ld long double
#define ll long long

map <int ,int> mpa,mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int N,K;
  cin >> N >> K;
  string s;
  cin >> s;
  string ans=s;
  sort(ans.begin(),ans.end());
  //cout << ans << endl;
  do{
    int cnt=0;
    for(int i=0;i<N;i++){
      if(ans[i]!=s[i])cnt++;
    }
    if(K>=cnt){
      cout << ans << endl;
      return 0;
    }
  }while(next_permutation(ans.begin(),ans.end()));
  cout << s << endl;
  return 0;
}

Submission Info

Judge Result