#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 m,int mid){ if(m>=(a[mid+1]*mid-sum[mid])){ return true; } return false; } 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; for(int i=1;i<=n;i++){ sum[i]=sum[i-1]+a[i]; } for(int i=n;i>=1;i--){ if(m<=0)break; if(m>=(A-a[i])){ m-=(A-a[i]); if(m>0){ int l=1,r=i-1; while(l<r){ int mid=(l+r)>>1; if(check(mid,m))l=mid+1; else r=mid; } ans=max(ans,a[l]*cm+(n-i+1)*cf); } else{ ans=max(ans,a[1]*cm+(n-i+1)*cf); } } } cout<<ans; return 0; }