백준 소스코드 [C++] 13305 주유소

www.acmicpc.net/problem/13305

13305번: 주유소

백준 소스코드 [C++] 13305 주유소

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
typedef long long ll;
using namespace std;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	ll cost[100001], dist[100001];
	memset(cost, 0, sizeof(cost));
	cin >> n;
	for (int i = 1;i < n;i++) cin >> dist[i];
	for (int i = 0;i < n;i++) cin >> cost[i];
	for (int i = 0;i <n-1;i++) {
		int j = i;
		while ((cost[j] < cost[j+1]) && (j<n)) {
			cost[j+1]=cost[j];
			j++;
		}
	}
	ll sum = 0;
	for (int i = 0;i < n - 1;i++) sum += cost[i] * dist[i+1];
	cout << sum;
	return 0;
}