Submission #1070230

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

ll n, dis[100010], a, b;

int main() {
	cin >> n >> a >> b;
	REP(i, n){
		cin >> dis[i];
	}
	ll ans = 0;
	int now = dis[0];
	for(int i = 1;i < n;i++){
		int cost = min((dis[i] - now) * a, b);
		now = dis[i];
		ans += cost;
	}

	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result