#include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } using P = pair; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n; cin >> n; ll a, b, x, y; cin >> a >> b >> x >> y; vector h(n); priority_queue

que; for(int i = 0; i < n; i++) { cin >> h[i]; que.push(P(h[i], i)); } while(a > 0){ auto [_, i] = que.top(); que.pop(); a--; h[i] -= x; if(h[i] <= 0) continue; que.push(P(h[i], i)); } ll sum = accumulate(h.begin(), h.end(), 0ll); if(sum <= y*b+x*a){ cout << "Yes" << endl; }else{ cout << "No" << endl; } }