Submission #174401

---

Source Code Expand

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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(int *x, int *y){reader(x);reader(y);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}return s;}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}

int N, K;
char in[1000], res[1000];
int rest[26];

int is_ok(void){
  int i, j, dame = 0;
  int now[26];

  rep(i,26) now[i] = rest[i];
  rep(i,N) if(res[i]!='*' && res[i]!=in[i]) dame++;
  rep(i,N) if(res[i]=='*'){
    if(now[in[i]-'a']) now[in[i]-'a']--;
    else               dame++;
  }

  if(dame > K) return 0;
  return 1;
}

int main(){
  int i, j;

  reader(&N,&K);
  reader(in);

  rep(i,N) res[i] = '*';
  res[N] = '\n';
  res[N+1] = '\0';

  rep(i,26) rest[i] = 0;
  rep(i,N) rest[in[i]-'a']++;

  rep(i,N){
    rep(j,26) if(rest[j]){
      rest[j]--;
      res[i] = 'a' + j;
      if(is_ok()) break;
      rest[j]++;
    }
  }

  writer(res);

  return 0;
}

Submission Info

Judge Result