[Python]백준 - 상근날드(5543번)

문제출처 - https://www.acmicpc.net/problem/5543

5543번: 상근날드

풀이1

burger = []
drink = []
for i in range(3):
    temp = int(input())
    burger.append(temp)
for i in range(2):
    temp = int(input())
    drink.append(temp)

cheap = 10000
for i in range(3):
    for j in range(2):
        if burger[i] + drink[j] - 50 < cheap:
            cheap = burger[i] + drink[j] - 50

print(cheap)

 

풀이2

burger = []
drink = []
for i in range(3):
    temp = int(input())
    burger.append(temp)
for i in range(2):
    temp = int(input())
    drink.append(temp)

cheap = min(burger) + min(drink) - 50

print(cheap)

 

채점결과 풀이1과 풀이2의 메모리와 시간은 동일하다.