Problem: 2050D - Digital string maximization
Language: python

Solution 1 (runtime: 312 ms):
import math
from decimal import Decimal, getcontext
import itertools
import queue
from collections import Counter, deque
import bisect
import sys


def list_read(t: type = int):
    return list(map(t, input().split()))


def params_read(t: type = int):
    return map(t, input().split())


def pprint(A):
    if len(A) > 0:
        if type(A[0]) != list:
            A = [A]
    for i in range(len(A)):
        print(*A[i])


def sieve(N):
    primes = [i for i in range(N + 1)]
    primes[1] = 0
    i = 2
    while i <= N:
        if primes[i] != 0:
            j = i + i
            while j <= N:
                primes[j] = 0
                j = j + i
        i += 1
    primes = [i for i in primes if i != 0]

    return primes


def sum_of_the_digits(a):
    return sum(map(int, str(a)))


def binpow(a, n, mod):
    res = 1
    while n != 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def get_next_symbol(a, p=26):
    ABC = list(".abcdefghijklmnopqrstuvwxyz{")
    a = ord(a)
    a += 1
    a = chr(a)
    p = ABC[p + 1]
    if a == p:
        a = "a"
    return a


def Cnk(n, k, MOD):
    if k > n:
        return 0
    if k == 0 or k == n:
        return 1
    k = min(k, n - k)
    c = 1
    for i in range(k):
        c = c * (n - i) // (i + 1)
        c %= MOD
    return c


def alg_sum(a, b, n):
    return int((a + b) / 2 * n)  # int(Decimal(a + b)/2 * n)


def get_factors(n):
    factors = []

    i = 1
    while i * i < n:
        if n % i == 0:
            factors.append(i)
            factors.append(n // i)
        i += 1

    if i * i == n:
        factors.append(i)

    return factors


def factorize(n):
    primes = []
    while n % 2 == 0:
        primes.append(2)
        n //= 2

    i = 3
    while i * i <= n:
        while n % i == 0:
            primes.append(i)
            n //= i
        i += 2

    if n > 1:
        primes.append(n)

    return primes


def fact_for_binom(n, MOD):
    # (f[N] * invf[K] * invf[N - K]) % MOD

    f = [1]
    invf = [1]

    for i in range(1, n):
        f.append(f[-1] * i % MOD)
        f[-1] %= MOD

        invf.append(binpow(f[-1], MOD - 2, MOD))
        invf[-1] %= MOD
    return f, invf


# n = int(input())
# MOD = 1000000007
def solve():
    A = list(input())

    for i in range(len(A)):
        curr_d = int(A[i])
        pos = i
        for j in range(i+1, min(len(A), i + 10)):
            new_d = int(A[j]) - j + i
            if new_d > curr_d:
                curr_d = new_d
                pos = j
        A[pos] = str(curr_d)
        for j in range(pos-1, i-1, -1):
            A[j], A[j+1] = A[j+1], A[j]
    print("".join(A))

def main():
    t = 1
    t = int(input())
    for i in range(t):
        solve()


main()

Solution 2 (runtime: 156 ms):
for _ in range(int(input())):

a = input()

s = [int(digit) for digit in a]

n = len(s)

for i in range(n):

best_value = s[i]

best_idx = -1

for j in range(i + 1, min(i + 9, n)):

score = s[j]-(j - i)

if score>best_value:

best_value=score

best_idx=j



if best_idx != -1:

# print(best_value,s[best_idx],i,best_idx)

s[i], s[best_idx] = best_value, s[i]

for j in range(best_idx, i+1, -1):

s[j], s[j - 1] = s[j - 1], s[j]

# print(s)



print("".join(map(str, s)))