#include<bits/stdc++.h> #define ll long long using namespace std; int n; ll m,a[100005],sum[100005],A,cf,cm,s,maxx; bool check(ll x,int id) { int l=1,r=id-1; while(l<r) { int mid=(l+r+1)/2; if(a[mid]<x) { l=mid; } else { r=mid-1; } } ll ans=l*x-sum[l]; return m>=ans; } int main() { cin>>n>>A>>cf>>cm>>m; for(int i=1;i<=n;i++) { cin>>a[i]; } sort(a+1,a+n+1); for(int i=1;i<=n;i++) { sum[i]=sum[i-1]+a[i]; } ll l=a[1],r=A-1; while(l<r) { ll mid=(l+r+1)/2; if(check(mid,n+1)) { l=mid; } else { r=mid-1; } } s=l*cm; // cout<<s<<'\n'; maxx=max(maxx,s); for(int i=n;i>=1;i--) { if(m<A-a[i]) { break; } m-=A-a[i]; ll l=a[1],r=A-1; while(l<r) { ll mid=(l+r+1)/2; if(check(mid,i)) { l=mid; } else { r=mid-1; } } s=(n-i+1)*cf+l*cm; if(i==1) { s=n*cf+A*cm; } // cout<<s<<'\n'; maxx=max(maxx,s); } cout<<maxx; return 0; }