using System.Collections.Generic; using System.Linq; using System; public class PriorityQueue where T : IComparable { private IComparer _comparer = null; private int _type = 0; private T[] _heap; private int _sz = 0; private int _count = 0; public PriorityQueue(int maxSize, IComparer comparer) { _heap = new T[maxSize]; _comparer = comparer; } public PriorityQueue(int maxSize, int type = 0) { _heap = new T[maxSize]; _type = type; } private int Compare(T x, T y) { if (_comparer != null) return _comparer.Compare(x, y); return _type == 0 ? x.CompareTo(y) : y.CompareTo(x); } public void Push(T x) { _count++; var i = _sz++; while (i > 0) { var p = (i - 1) / 2; if (Compare(_heap[p], x) <= 0) break; _heap[i] = _heap[p]; i = p; } _heap[i] = x; } public T Pop() { _count--; T ret = _heap[0]; T x = _heap[--_sz]; int i = 0; while (i * 2 + 1 < _sz) { int a = i * 2 + 1; int b = i * 2 + 2; if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b; if (Compare(_heap[a], x) >= 0) break; _heap[i] = _heap[a]; i = a; } _heap[i] = x; return ret; } public int Count() => _count; public T Peek() => _heap[0]; public bool Contains(T x) { for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true; return false; } public void Clear() { while (this.Count() > 0) this.Pop(); } public IEnumerator GetEnumerator() { var ret = new List(); while (this.Count() > 0) { ret.Add(this.Pop()); } foreach (var r in ret) { this.Push(r); yield return r; } } public T[] ToArray() { T[] array = new T[_sz]; int i = 0; foreach (var r in this) { array[i++] = r; } return array; } } public class P : IComparable { public int id { get; set; } public long d { get; set; } public int CompareTo(object obj) { var x = (P)obj; if (this.d > x.d) return 1; else if (this.d == x.d) return 0; else return -1; } } public class Hello { static void Main() { string[] line = Console.ReadLine().Trim().Split(' '); var n = int.Parse(line[0]); var a = int.Parse(line[1]); var b = int.Parse(line[2]); var x = int.Parse(line[3]); var y = int.Parse(line[4]); line = Console.ReadLine().Trim().Split(' '); var h = Array.ConvertAll(line, long.Parse); getAns(n, a, b, x, y, h); } static void getAns(int n, int a, int b, int x, int y, long[] h) { var pq = new PriorityQueue

(n + 100, 1); for (int i = 0; i < n; i++) pq.Push(new P { id = i, d = h[i] }); while (a > 0) { if (pq.Count() == 0) break; var w = pq.Pop(); var w2 = w.d - x; if (w2 > 0) { h[w.id] = w2; w.d = w2; pq.Push(w); a--; } else h[w.id] = w2; } var hsum = h.Sum(); Console.WriteLine(b * y >= hsum ? "Yes" : "No"); } }