Submission #4061959

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <deque>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <set>
#define INF 1000000000000
using namespace std;
using ll = long long;
int main(){
    ll n,k;
    string s;
    cin >> n >> k >> s;
    vector<string> str(n);
    for(int i=0;i<n;i++){
        str[i] = s.substr(i,1);
    }
    sort(str.begin(),str.end());
    do{
        int cnt =0;
        for(int i=0;i<n;i++){
            if(str[i]!=s.substr(i,1)){
                
                cnt++;
            }
        }
        if(cnt<=k){
            for(int i=0;i<n;i++){
                cout << str[i];
            }
            cout << endl;
            return 0;
        }
    }while(next_permutation(str.begin(),str.end()));
}

Submission Info

Judge Result