1208. [S/W 문제해결 기본] 1일차 - Flatten

https://swexpertacademy.com/main/code/problem/problemDetail.do

SW Expert Academy

 

for test in range(1, 11):
    #덤프 횟수
    n = int(input())
 
    array = list(map(int,input().split()))
    num = len(array)
    for i in range(n):
        array.sort()
        array[0] = array[0] + 1
        array[num-1] = array[num-1] - 1
    count = max(array) - min(array)
    print(f'#{test} {count}')