[알고리즘] 백준 2484 주사위 네개 / python

https://www.acmicpc.net/problem/2484

2484번: 주사위 네개

 

 

def func(lst):
    if len(set(lst)) == 1:
        return 50000 + lst[0] * 5000
    if len(set(lst)) == 2:
        if lst[1] == lst[2]:
            return 10000 + lst[1] * 1000
        else:
            return 2000 + lst[0] * 500 + lst[2] * 500
    for i in range(3):
        if lst[i] == lst[i+1]:
            return 1000 + lst[i] * 100
    return lst[3] * 100

N = int(input())
max_lst = []
for _ in range(N):
    lst = sorted(list(map(int, input().split())))
    max_lst.append(func(lst))
print(max(max_lst))