[백준] 10431. 줄세우기

난이도 쉬운편. 단순 구현

p=int(input())
answer=[]
for i in range(p):
    cnt = 0
    heights = []
    h=list(map(int,input().split()))
    heights.append(h[1])
    for j in range(2,21):
        if h[j]<max(heights):
            for idx,k in enumerate(heights):
                if k>h[j]:
                    heights.insert(idx,h[j])
                    cnt+=len(heights)-idx-1
                    break
        else:
            heights.append(h[j])
    answer.append((h[0],cnt))

for a,b in answer:
    print(a,b)