Submission #1065838

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=2000100,mod=1e9+7;
inline int read(){
    int x=0,c=getchar(),f=0;
    for(;c>'9'||c<'0';f=c=='-',c=getchar());
    for(;c>='0'&&c<='9';c=getchar())
    x=(x<<1)+(x<<3)+c-'0';return f?-x:x;
}
void write(ll x){
    if(x>9)write(x/10);
    putchar(x%10+'0');
}char s[N];ll ans;
int m,i,a,b,n,x,sm[N],pri[N],j,k,v[N];
int main(){
	n=read();a=read();b=read();
	x=read();for(i=2;i<=n;i++){
		k=read();
		ans+=min(1ll*b,1ll*a*(k-x));
		x=k;
	}write(ans);putchar('\n');
	return 0;
}

Submission Info

Judge Result