Submission #2695853

---

Source Code Expand

from collections import Counter
from heapq import heappush,heappop
def match(A,B):
	num = 0
	for i in range(len(A)): num+=(A[i]==B[i])
	return len(A)-num
def match2(A,B):
	a,b,num = Counter(A),Counter(B),0
	for i in range(97,123): num+=min(a[i],b[i])
	return len(A)-num
n,k = (int(i) for i in input().split())
s = input()
c,x,y,w,w2,ans = Counter(s),len(s),[],[],[],""
for i in s:
	heappush(w,ord(i))
	y.append(ord(i))
for i in range(x):
	while True:
		p = heappop(w)
		if match(ans+chr(p),s[:i+1])+match2(y[i+1:],list(w+w2))<=k:
			for j in w2: heappush(w,j)
			ans,w2 = ans+chr(p),[]
			break
		else: w2.append(p)
print(ans)

Submission Info

Judge Result