For this Question: There are N cities on X-axis and you want to visit all of them. For traveling you can walk or teleport. 
For 1 unit walk the cost is A unit. The price is B units for teleportation from any point to any other. 
Find the minimum possible total cost when you visit all the cities. Initially, you are at city 1.The first line of input contains three space-separate integers N, A, B
The second input line includes N distinct space-separated integers X1, X2,.....Xn which are the coordinates of the city on the X-axis.

<b>Constraints:-</b>
1 <= N <= 10<sup>5</sup>
1 <= A,B <= 10^9
1 <= Xi <= 10^9
Xi < X(i+1)Print the minimum possible total cost when you visit all the cities.Sample Input :
4 2 5
1 2 5 7

Sample Output :
11

<b>Explanation:</b>
From town 1, walk a distance of 1 to town 2, then teleport to town 3, then walk a distance of 2 to town 4. The total increase of your fatigue level, in this case, is 2×1 + 5 + 2×2 = 11, which is the minimum possible value., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;

typedef long long ll;

int main(void) {
#ifdef ANIKET_GOYAL
    freopen("inputf.in", "r", stdin);
    freopen("outputf.in", "w", stdout);
#endif
    long long n, a, b;
    cin >> n >> a >> b;
    assert(1 <= n <= 100000);
    assert(1 <= a <= 1000000000);
    assert(1 <= b <= 1000000000);

    long long ans = 0;
    int pos = 0;
    int prev;
    REP(i, n) {
        int x;
        cin >> x;
        assert(1 <= x <= 1000000000);
        if (i) {
            if (x < prev) {
                cout << prev << " " << x << "\n";
                return 0;
            }
        }
        if (i == 0) {
            pos = x;
        } else {
            ans += min(a * (x - pos), b);
            pos = x;
        }
        prev = x;
    }
    cout << ans << endl;
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?