Submission #1575422

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;



int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, a, b;
    cin >> n >> a >> b;
    VL dist(n);
    ll prev_x;
    cin >> prev_x;
    ll ans = 0;
    REP(i, n - 1){
        ll x;
        cin >> x;
        ans += min((x - prev_x) * a, b);
        prev_x = x;
    }
    cout << ans << "\n";

    return 0;
}

Submission Info

Judge Result