ALGORITHM/BOJ

백준 1041 python 문제풀이

24_bean 2022. 7. 11. 13:27
import sys

if __name__ == '__main__':
    N = int(input())
    arr = list(map(int, sys.stdin.readline().split()))
    ans = 0
    min_lists = []
    if N == 1:
        arr.sort()
        for i in range(5):
            ans += arr[i]
    else:
        min_lists.append(min(arr[0], arr[5]))
        min_lists.append(min(arr[1], arr[4]))
        min_lists.append(min(arr[2], arr[3]))
        min_lists.sort()

        min1 = min_lists[0]
        min2 = min_lists[1]
        min3 = min_lists[2]

        n1 = 4 * (N - 2) * (N - 1) + (N - 2) ** 2
        n2 = 4 * (N - 1) + 4 * (N - 2)
        n3 = 4

        n1 = 5*(N**2) - 8*N + 4
        n2 = 8*N - 8
        n3 = 4

        ans += min1 * n1
        ans += min2 * n2
        ans += min3 * n3
    print(ans)

'ALGORITHM > BOJ' 카테고리의 다른 글

백준 11758 / c++ (코드)  (0) 2023.01.08
백준 11723 python 문제풀이  (0) 2022.07.11
백준 1013 python 문제풀이  (0) 2022.07.11
백준 1016 python 문제풀이  (0) 2022.07.11