#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include #include #define rep(i,n) for(int i=0;i<(n);i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) ((int)(x).size()) #define pb push_back using ll = long long; using namespace std; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> N >> A >> B >> X >> Y; priority_queue q; rep(i,N){ ll x; cin >> x; q.push(x); } rep(i,A){ q.push(q.top()-X); q.pop(); } ll s=0; while(!q.empty()){ s+=max(0LL,q.top()); q.pop(); } if(s<=B*Y) cout << "Yes" << endl; else cout << "No" << endl; return 0; }