#include <bits/stdc++.h>
using namespace std;
const long long int INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
int n, a, b, c, T, d;
vector<int> t;
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  scanf("%d %d %d %d %d", &n, &a, &b, &c, &T);
  for (int i = 0; i < n; i++) {
    scanf("%d", &d);
    t.push_back(d);
  }
  t.push_back(T);
  sort(t.begin(), t.end());
  int x = 0;
  for (int i = 1; i <= n; i++) {
    x += (t[i] - t[i - 1]) * i;
  }
  int c1 = c * x;
  for (int i = 0; i < n; i++) {
    c1 = c1 + (a - (T - t[i]) * b);
  }
  int c2 = n * a;
  printf("%d", max(c1, c2));
  return 0;
}
