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