#include<bits/stdc++.h> using namespace std; #define int long long int n,A,cf,cm,m,sum[100005]; int a[100005],cnt; int ans; inline bool check(int mii,int mi){ if(m==0)return false; int l=1,r=mi; while(l<r){ int mid=(l+r+1)>>1; if(a[mid]>mii)r=mid-1; else l=mid; } return m>=a[mi+1]*mi-sum[r]; } signed main(){ cin>>n>>A>>cf>>cm>>m; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]==A)cnt++; } sort(a+1,a+n+1); ans=cnt*cf+a[1]*cm; int tm=m; for(int i=1;i<=n;i++){ sum[i]=sum[i-1]+a[i]; } for(int i=n;i>=1;i--){ if(tm<=0)break; if(a[i]==A)continue; tm-=a[i]; cnt++; } ans=max(ans,cnt*cf+a[1]*cm); for(int i=n;i>=1;i--){ if(m<=0)break; if(a[i]==A)continue; if(m>=(A-a[i])){ m-=(A-a[i]); a[i]=A; int l=a[1],r=A; while(l<r){ int mid=(l+r+1)>>1; if(!check(mid,i-1))r=mid-1; else l=mid; } ans=max(ans,r*cm+(n-i+1)*cf); } else break; } cout<<ans; return 0; }