[Python] SWEA D3 : 1208 - [S/W 문제해결 기본] 1일차 - Flatten

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV139KOaABgCFAYh&categoryId=AV139KOaABgCFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

---

📌 작성한 코드 1

for test in range(1,11):
    num = int(input())
    arr = list(map(int,input().split()))
    for i in range(num):
        max_num = max(arr)
        min_num = min(arr)
        arr[arr.index(max_num)] -= 1
        arr[arr.index(min_num)] += 1
    print(f'#{test} {max(arr)-min(arr)}')

 

 

📌 작성한 코드 2 

for test in range(1,11):
    num = int(input())
    arr = list(map(int,input().split()))
    sorted_arr = sorted(arr)

    for i in range(num):
        sorted_arr[-1] -= 1
        sorted_arr[0] += 1
        if sorted_arr[-1] < sorted_arr[-2]:
            sorted_arr = sorted(sorted_arr)
        
        if sorted_arr[0] > sorted_arr[1]:
             sorted_arr = sorted(sorted_arr)
    
    print(f'#{test} {max(sorted_arr)-min(sorted_arr)}')