[C/C++] 백준 13305번 - 주유소 (그리디)

 

<코드>

#include<iostream>
#include<algorithm>
using namespace std;

#define MAX 1000000000 // 10억

long long dist[100001];
long long price[100001];
long long N, sum;
long long greedy;

int main()
{
	cin >> N;

	for (int i = 1; i <= N - 1; i++)
		cin >> dist[i];
	
	for (int i = 1; i <= N; i++)
		cin >> price[i];
	
	greedy = MAX;

	for (int i = 1; i <= N - 1; i++)
	{
		if (price[i] < greedy)
			greedy = price[i];
		sum += greedy * dist[i];
	}

	cout << sum;

}

 

 

 

www.acmicpc.net/problem/13305

13305번: 주유소