[백준] 13305번 주유소 [Python]

• 문제 : https://www.acmicpc.net/problem/13305
• Greedy Algorithm

n = int(input())
road = list(map(int, input().split()))
price = list(map(int, input().split()))

won = price[0]
sum = 0

for i in range(n-1):
    if won > price[i]: # 더 싼 주유소가 나오면
        won = price[i]	# 가격을 바꿔주자
    sum += (won * road[i])
    
print(sum)