Submission #1244159

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long int ll;
#define MOD (1000000007);
#define INF (2e9)


int check_p(int n){
	int p=2;
	while(p*p<=n){
		if(n%p==0){
			return 0;
		}
		p++;
	}
	return 1;
}

int main(void){
	ll n,a,b;
	cin>>n>>a>>b;
	ll x1,x2;
	cin>>x1;
	ll ans=0;
	for(int i=1;i<n;i++){
		cin>>x2;
		ans+=min((x2-x1)*a,b);
		x1=x2;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result