#include <bits/stdc++.h> using namespace std; long long n,A,cf,cm,m,ans,s; long long a[100005],sum[100005]; bool check(int x,int cur){ int l=1,r=cur-1; while(l<r){ int mid=(l+r+1)/2; if(a[mid]<x) l=mid; else r=mid-1; } long long ans=l*x-sum[l]; return m>=ans; }// int main(){ // freopen("myth.in","r",stdin); // freopen("myth.out","w",stdout); cin>>n>>A>>cf>>cm>>m; for(int i=1;i<=n;i++){ cin>>a[i]; }sort(a+1,a+1+n); for(int i=1;i<=1;i++){ sum[i]=sum[i-1]+a[i]; } if(m>=A*n-sum[n]){ cout<<n*cf+A*cm; return 0; } long long l=1,r=A-1; while(l<r){ long long mid=(l+r+1)/2; if(check(mid,n+1)) l=mid; else r=mid-1; } s=l*cm; ans=max(ans,s); for(int i=n;i>=1;i--){ if(m<A-a[i]) break; m-=A-a[i]; long long l=a[1],r=A-1; long long mid; while(l<r){ mid=(l+r+1)/2; if(check(mid,i)) l=mid; else r=mid-1; } if(i==1){ s=n*cf+A*cm; } s=(n-i+1)*cf+mid*cm; ans=max(ans,s); } cout<<ans; return 0; } //myth /* 3 5 10 1 5 1 3 1 3 5 10 1 339 1 3 1 */