Submission #3788608

---

Source Code Expand

N, K = map(int, input().split())
S = [s for s in input()]
_S = sorted(S)
ans = ''
diff = 0
pos = 0
while _S:
  for i, s in enumerate(_S):
    _ans = ans + s
    _diff = diff + (1 if S[pos] != s else 0)
    left = [_s for _s in _S]
    left.pop(i)
    uniq = list(set(left))
    if sum([max(left.count(u) - S[pos + 1:].count(u), 0) for u in uniq]) <= K - _diff:
      break
  ans += s
  diff += 1 if S[pos] != s else 0
  _S.pop(i)
  pos += 1
print(ans)

Submission Info

Judge Result