1367D - Task On The Board - CodeForces Solution

for i in range(int(input())):
  s=input()
  n=int(input())
  A=list(map(int,input().split()))
  D,L=dict(),[]
  for j in range(len(s)):
    if s[j] in D:
      D[s[j]]+=1
    else:
      D[s[j]]=1
      L.append(s[j])
  L.sort(reverse=True)
  N=[None for j in range(n)]
  G=[]
  pos=0
  count=0
  while count<n:
    S=[]
    for j in range(n):
      diff=0
      for e in G:
        diff+=abs(e-j)
      if diff==A[j]:
        S.append(j)
    S=list(set(S).difference(set(G)))
    while len(S)>D[L[pos]]:
      pos+=1
    for j in S:
      N[j]=L[pos]
      G.append(j)
      count+=1
    pos+=1
  ans=''
  for j in N:
    ans+=j
  print(ans)