[백준 13305번] 주유소

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int n, dist[100001], prev = 1000000001;
    long long result=0;
    cin >> n;
    for (int i = 0; i < n - 1; i++)
        cin >> dist[i];
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        prev = (prev > a ? a : prev);
        result += (i!=n-1?prev*dist[i]:0);
    }
    cout << result << '\n';
    return 0;
}