[SWEA] 1208 Flatten (파이썬/python)

🎈문제

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

 

🎁알고리즘 및 접근

구현

두 가지 방법으로 풀어보았다. 

1. 정렬

2. index로 접근

 

💻1. 정렬 코드

# sw 1208 Flatten

for test_case in range(1, 11):
    dump = int(input())
    lst = list(map(int,input().split()))
    lst.sort()
    while dump:  
        lst[-1] -= 1
        lst[0] += 1
        dump -= 1
        if (lst[0]>=lst[1]) or (lst[-1]<lst[-2]):
            lst.sort()

    print(f"#{test_case} {max(lst)-min(lst)}")

💻2. index로 접근

# sw 1208 Flatten

for test_case in range(1, 11):
    dump = int(input())
    lst = list(map(int,input().split()))

    while dump:  
        max_idx = lst.index(max(lst))
        min_idx = lst.index(min(lst))
        lst[max_idx] -= 1
        lst[min_idx] += 1
        dump -= 1
        if lst[max_idx] - lst[min_idx] < 2:
            break

    print(f"#{test_case} {max(lst)-min(lst)}")