Submission #1109291

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb         push_back

typedef long long ll;
const ll INF = 1000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;

int main(void) {
	//ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	int n, a, b;
	vector<long long> x;
	cin >> n >> a >> b;

	for(int i=0; i<n; i++){
		int t;
		cin >> t;
		x.pb(t);
	}

	ll ans = 0;
	for(int i=1; i<n; i++){
		ll cost = (x[i] - x[i-1]) * a;
		if(cost < b){
			ans += cost;
		}else{
			ans += b;
		}
	}

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

Submission Info

Judge Result