Submission #2211682

---

Source Code Expand

# -*- coding: utf-8 -*-
from copy import deepcopy
from string import ascii_lowercase
def inpl(): return list(map(int, input().split()))
N, K = inpl()
S = input()
T = [0] * 26
for i, a in enumerate(ascii_lowercase):
    T[i] = S.count(a)
S = list(S)
rS = deepcopy(S)
res = "".join(S)

def count_changed(S_):
    return sum([1 for a, b in zip(rS, S_) if a != b])
    
j = 0

while j < N:
    l = max(0, ord(S[j])-97)
    if sum(T[:l]) == 0:
        T[l] -= 1
        j += 1
    else:
        for p, t in enumerate(T):
            if t != 0:
                break
        T[p] -= 1
        q = len(S) - 1 - S[::-1].index(chr(p+97))
        S[j], S[q] = S[q], S[j]
        if count_changed(S) > K:
            break
        res = "".join(S)
        j += 1

print(res)

Submission Info

Judge Result