Submission #1590461

---

Source Code Expand

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

int diff(string s, string t){
    int cs[26] = {0}, ct[26] = {0};

    for(int i=0;i<s.size();++i){
        cs[s[i]-'a']++;
        ct[t[i]-'a']++;
    }

    int res = 0;
    for(int i=0;i<26;++i){
        res += min(cs[i], ct[i]);
    }

    res = s.size() - res;
    return res;
}

int main(){
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;

    string unused = s;
    sort(unused.begin(), unused.end());

    string ans = "";
    for(int i=0;i<n;++i){
        char top = s[0];
        s.erase(s.begin());
        for(int j=0;j<unused.size();++j){
            string wu = unused;
            wu.erase(wu.begin() + j);
            int d = diff(s, wu);
            if(top == unused[j] && d <= k || top != unused[j] && d < k){
                ans += unused[j];
                if(top != unused[j])k--;
                unused.erase(unused.begin() + j);
                break;
            }
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result