fork(1) download
  1. from collections import deque
  2. import sys
  3. n, k = map(int, sys.stdin.readline().split(" "))
  4. num = deque( sys.stdin.readline())
  5. num.pop()
  6. cnt = 0
  7. sw = 0
  8. while True:
  9. s = num.popleft()
  10. isSort = True
  11. for i in range(len(num)):
  12. tmp = num.popleft()
  13. if s[-1] < tmp:
  14. cnt += 1
  15. isSort = False
  16. s = s[:-1]+tmp
  17. else:
  18. s += tmp
  19. if cnt == k:
  20. for j in range(len(s)-1, -1, -1):
  21. num.appendleft(s[j])
  22. sw = 1
  23. break
  24. if sw:
  25. break
  26. if isSort:
  27. num = deque(s)
  28. for i in range(k-cnt):
  29. num.pop()
  30. break
  31. num = deque(s)
  32.  
  33. for i in range(len(num)):
  34. print(num.popleft(), end="")
Success #stdin #stdout 0.02s 9184KB
stdin
7 3
1231234
stdout
323