Submission #4049559

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;

int a[26];

int main(){
  int N,K; cin>>N>>K;
  string S; cin>>S;
  rep(i,N) a[S[i]-'a']++;
  string T="";
  rep(i,N){
    rep(j,26){
      if(a[j]==0) continue;
      a[j]--;
      int sz=N-((S[i]-'a')==j);
      rep(k,i) sz-=(S[k]==T[k]);
      int b[26]={};
      for(int k=i+1;k<N;k++) b[S[k]-'a']++;
      for(int k=0;k<26;k++) sz-=min(a[k],b[k]);
      if(sz<=K){
        char x='a';
        rep(k,j) x++;
        T+=x;
        break;
      }
      a[j]++;
    }
  }
  cout<<T<<endl;
  return 0;
}

Submission Info

Judge Result