#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; ll mod=1e9+7; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} // return val=p(N) // a=p[0].first^p[0].second * ... *p[N-1].first^p[N-1].second // for all i: p[i].first is prime number // O(sqrt(val)) std::vector> Prime_factorization(long long val){ assert(val>=1); if(val==1){ return {}; } int ind=0; std::vector> ans; for(long long i=2;i*i<=val;i++){ if(val%i!=0) continue; ans.push_back({i,0}); while(val%i==0){ ans[ind].second++; val/=i; } ind++; } if(val!=1) ans.push_back({val,1}); return ans; } void solve(); // rainy ~ 雨に打たれて ~ int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } void solve(){ ll N,A,B,X,Y,a; cin>>N>>A>>B>>X>>Y; vector H(N); rep(i,N) cin>>H[i]; ll l=-1,r=1e9; while(r-l>1){ ll med=(r+l)/2; priority_queue pq; rep(i,N) pq.push(max(0ll,H[i]-med)); rep(i,A){ a=pq.top(); pq.pop(); pq.push(max(0ll,a-X)); } ll Z=Y*B; rep(i,N){ a=pq.top(); Z-=a; pq.pop(); } if(Z>=0) r=med; else l=med; } yneos(r==0); }