#include <bits/stdc++.h>
using namespace std;
int a, b, c, n, t, f, ans;
vector<int> v;
queue<int> q;
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> a >> b >> c >> t;
  for (int i = 0; i < n; i++) {
    cin >> f;
    v.push_back(f);
  }
  sort(v.begin(), v.end());
  for (auto u : v) q.push(u);
  v.clear();
  int luku1 = 0;
  int luku2 = 0;
  int luku3 = 0;
  for (int i = 0; i <= t; i++) {
    while (q.front() == i) {
      v.push_back(q.front());
      q.pop();
      luku1 += a;
    }
    luku2 += v.size() * c;
  }
  luku2 -= v.size() * c;
  for (auto u : v) {
    luku2 += a + (u - t) * b;
  }
  ans = max(luku1, max(luku2, luku3));
  cout << ans;
}
