Submission #1532535

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;
using LL = long long;
int main() {
	LL n, a, b;
	cin >> n >> a >> b;
	LL ans = 0;
	LL x[100001];
	for (int i = 0; i < n; i++) {
		cin >> x[i];
	}
	for (int i = 0; i < n - 1; i++) {
		ans += min((x[i + 1] - x[i])*a, b);
	}
	cout << ans << endl;
}

Submission Info

Judge Result