[그리디][파이썬][백준] 13305번 주유소

# 13305번 주유소
n = int(input())
distance = list(map(int,input().split()))
price = list(map(int,input().split()))
distance.insert(-1,0)
m = min(price[:-2])
cost,oil = 0,0
for i in range(n):

    if price[i] == m:
        for j in range(i,n):
            cost += distance[j]*price[i]
            oil += distance[j]
            break
    else:
        if oil == 0:
            oil += distance[i]
            cost += distance[i]*price[i]
    oil -= distance[i]
print(cost)

Uploaded by Notion2Tistory v1.1.0