[파이썬] [SWEA] 4828. [파이썬 S/W 문제해결 기본] 1일차 - min max

swexpertacademy.com/main/learn/course/subjectList.do?courseId=AVuPDN86AAXw5UW6

SW Expert Academy

1. normal

T = int(input())
for tc in range(1,T+1):
    N = int(input())
    arr = list(map(int, input().split()))
    # 최대
    for i in range(len(arr)):
        if i == 0:
            data_max = arr[i]
            data_min = arr[i]
        else:
            if data_max < arr[i]:
                data_max = arr[i]
                if data_min > arr[i]:
                    data_min = arr[i]
            else:
                if data_min > arr[i]:
                    data_min = arr[i]

    print(f"#{tc} {data_max-data_min}".format(tc, data_max, data_min))