[백준] 주유소 (13305번)

단간단간·2024년 3월 26일
0

알고리즘 문제

목록 보기
12/106

출처 : https://www.acmicpc.net/problem/13305

python

import sys


def function():
    N = int(input())
    road_lengths = list(map(int, sys.stdin.readline().split()))
    oil_prices = list(map(int, sys.stdin.readline().split()))

    # 각 구간별 최소 주유 금액
    temp = [] 

    min_price = oil_prices[0]
    for i in range(len(oil_prices)):
        min_price = oil_prices[i] if oil_prices[i] < min_price else min_price
        temp.append(min_price)

    # 총 주유 금액
    total_price = 0
    
    for i in range(len(road_lengths)):
        total_price += road_lengths[i] * temp[i]

    print(total_price)


if __name__ == "__main__":
    function()
profile
simple is best

0개의 댓글