Submission #1987136

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> x(n);
  cin >> x[0];
  ll ans = 0;
  for (int i = 1; i < n; i++) {
    cin >> x[i];
    ans += min(1LL * (x[i] - x[i - 1]) * a, 1LL * b);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result