Submission #1067337

---

Source Code Expand

#include <iostream>
int main() {
    using namespace std;


    int N,A,B;
    int X[100000];

    cin >> N >> A >> B;
    for (int i=0;i < N;++i)
        cin >> X[i];

    int curSum = 0;
    for (int i=0;i < N-1;++i)
    {
        int walk = (X[i+1] - X[i])*A;
        if (walk < B)
            curSum += walk;
        else
            curSum += B;

    }

    cout << curSum << endl;

    return 0;
}

Submission Info

Judge Result