Submission #1529911

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
#include <set>
#include <map>

using namespace std;

const long long mod = 1000000007;

int main(void){
    int n, a, b, x[100005];
    cin >> n >> a >> b;
    for(int i=0; i<n; i++){
        cin >> x[i];
    }
    int pos=x[0];
    long long cost=0;
    for(int i=1; i<n; i++){
        if(a*(x[i]-pos) < b){
            cost += (long long)a*(x[i]-pos);
        }else{
            cost += b;
        }
        pos = x[i];
    }
    cout << cost << endl;
    return 0;
}

Submission Info

Judge Result