Submission #1590443

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}


char S[101],T[101];

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);


  ll N , K;cin >> N >> K;
  string str ; cin >> str;rep(i,N) S[i]=str[i];

  vector<ll>Tcnt(26);
  rep(i,N) Tcnt[S[i]-'a']++;
  rep(i,N){
    FOR(a,'a','z'+1) if(Tcnt[a-'a']>0){
      T[i]=a;
      Tcnt[a-'a']--;
      ll x = 0;
      rep(j,i+1) x += S[j] != T[j];
      vector<ll> Scnt(26);
      FOR(j,i+1,N)
	Scnt[S[j]-'a']++;
      ll y = 0;
      rep(j,26) y+= max(Scnt[j], Tcnt[j])-min(Scnt[j],Tcnt[j]);
      x+=y/2;
      if(x<=K) break;
      Tcnt[a-'a']++;
      T[i]='?';
    }

  }
  rep(i,N) cout << T[i]; cout << endl;
  return 0;

}

Submission Info

Judge Result