using System; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Numerics; using System.Threading; using static System.Math; namespace CpLibrary.Contest { public class SolverC : SolverBase { Scanner sr; bool HasMultipleTestcases { get; } public override void Solve() { var (n, a, b, x, y) = sr.ReadValue(); var h = sr.ReadLongArray(n); // PriorityQueue que; Comparison comp = Compare; var que = new PriorityQueue(comp); for (int i = 0; i < n; i++) { que.Enqueue(h[i]); } for (int i = 0; i < a; i++) { var t = que.Dequeue(); t = Max(0, t - x); que.Enqueue(t); } var h2 = que.ToArray(); long ok = 10000000000l; long ng = -1l; while(ok - ng > 1) { var mid = (ok + ng) / 2; long sum = 0; for (int i = 0; i < n; i++) { sum += Max(0, h2[i] - mid); } if (sum <= b * y) ok = mid; else ng = mid; } Console.WriteLine(ok); } public int Compare(long x, long y) { if (x == y) return 0; else if (x > y) return -1; return 1; } public SolverC(Scanner sr) => this.sr = sr; public override void Run() { var _t = 1; if (HasMultipleTestcases) _t = sr.ReadInt(); while (_t-- > 0) Solve(); } } public class PriorityQueue : IEnumerable { private readonly List heap; private readonly IComparer comparer; public PriorityQueue(IComparer comparer) { this.comparer = comparer; this.heap = new List(); } public PriorityQueue(Comparison comparison) : this(Comparer.Create(comparison)) { } public PriorityQueue() : this(Comparer.Default) { } public void Enqueue(T item) { this.heap.Add(item); int index = this.Count - 1; while (index > 0) { var par = Parent(index); if (comparer.Compare(heap[index], heap[par]) >= 0) break; Swap(index, par); index = par; } } public T Dequeue() { var ret = this.Peek; var last = this.Count - 1; heap[0] = heap[last]; heap.RemoveAt(last--); var index = 0; while (true) { var (r, l) = Child(index); int child; if (l <= last) { if (comparer.Compare(heap[l], heap[r]) < 0) child = l; else child = r; } else if (r <= last) child = r; else break; if (comparer.Compare(heap[index], heap[child]) <= 0) break; Swap(index, child); index = child; } return ret; } public T Peek => heap[0]; public int Count => heap.Count; private void Swap(int a, int b) { var t = heap[a]; heap[a] = heap[b]; heap[b] = t; } private int Parent(int index) => (index - 1) / 2; private (int l, int r) Child(int index) => (2 * index + 1, 2 * index + 2); public IEnumerator GetEnumerator() { var ret = new List(); while (this.Count > 0) { ret.Add(this.Dequeue()); } for (int i = 0; i < ret.Count; i++) { this.Enqueue(ret[i]); } foreach (var e in ret) { yield return e; } } System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() => GetEnumerator(); } public static class ProgramC { private static bool StartsOnThread = true; public static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var sr = new Scanner(new StreamReader(Console.OpenStandardInput())); var solver = new SolverC(sr); if (StartsOnThread) { var thread = new Thread(new ThreadStart(() => solver.Run()), 1 << 27); thread.Start(); thread.Join(); } else solver.Run(); Console.Out.Flush(); } public static void Expand() => SourceExpander.Expander.Expand(); } } #region Expanded by https://github.com/naminodarie/SourceExpander namespace CpLibrary { public class Scanner { public StreamReader sr { get; private set; } string[] str; int index; char[] separators; public Scanner(StreamReader sr, char[] separators) { this.sr = sr; this.separators = separators; str = new string[0]; index = 0; } public Scanner(StreamReader sr): this(sr, new char[]{' '}) { } public Scanner(): this(new StreamReader(Console.OpenStandardInput()), new char[]{' '}) { } public string Read() { if (index < str.Length) return str[index++]; string s; do s = sr.ReadLine(); while (s == ""); str = s.Split(separators, StringSplitOptions.RemoveEmptyEntries); index = 0; return str[index++]; } public string ReadString() => Read(); public string[] ReadStringArray(int n) { var arr = new string[n]; for (int i = 0; i < n; i++) { arr[i] = ReadString(); } return arr; } public int ReadInt() => int.Parse(ReadString()); public int[] ReadIntArray(int n) => ReadValueArray(n); public long ReadLong() => long.Parse(ReadString()); public long[] ReadLongArray(int n) => ReadValueArray(n); public double ReadDouble() => double.Parse(ReadString()); public double[] ReadDoubleArray(int n) => ReadValueArray(n); public BigInteger ReadBigInteger() => BigInteger.Parse(ReadString()); public T1 ReadValue() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); public T1[] ReadValueArray(int n) { var arr = new T1[n]; for (int i = 0; i < n; i++) { arr[i] = ReadValue(); } return arr; } public (T1, T2) ReadValue() => (ReadValue(), ReadValue()); public (T1, T2, T3) ReadValue() => (ReadValue(), ReadValue(), ReadValue()); public (T1, T2, T3, T4) ReadValue() => (ReadValue(), ReadValue(), ReadValue(), ReadValue()); public (T1, T2, T3, T4, T5) ReadValue() => (ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue()); public (T1, T2, T3, T4, T5, T6) ReadValue() => (ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue()); public (T1, T2, T3, T4, T5, T6, T7) ReadValue() => (ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue(), ReadValue()); public (T1[], T2[]) ReadValueArray(int n) { var(v1, v2) = (new T1[n], new T2[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i]) = ReadValue(); } return (v1, v2); } public (T1[], T2[], T3[]) ReadValueArray(int n) { var(v1, v2, v3) = (new T1[n], new T2[n], new T3[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i]) = ReadValue(); } return (v1, v2, v3); } public (T1[], T2[], T3[], T4[]) ReadValueArray(int n) { var(v1, v2, v3, v4) = (new T1[n], new T2[n], new T3[n], new T4[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i]) = ReadValue(); } return (v1, v2, v3, v4); } public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray(int n) { var(v1, v2, v3, v4, v5) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i]) = ReadValue(); } return (v1, v2, v3, v4, v5); } public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray(int n) { var(v1, v2, v3, v4, v5, v6) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i]) = ReadValue(); } return (v1, v2, v3, v4, v5, v6); } public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray(int n) { var(v1, v2, v3, v4, v5, v6, v7) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n], new T7[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i], v7[i]) = ReadValue(); } return (v1, v2, v3, v4, v5, v6, v7); } } } namespace CpLibrary { public interface ISolver { public void Solve(); public void Run(); } public abstract class SolverBase : ISolver { public abstract void Solve(); public abstract void Run(); public bool YesNo(bool condition) { Console.WriteLine(condition ? "Yes" : "No"); return condition; } public bool YESNO(bool condition) { Console.WriteLine(condition ? "YES" : "NO"); return condition; } public bool yesno(bool condition) { Console.WriteLine(condition ? "yes" : "no"); return condition; } } } namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}} #endregion Expanded by https://github.com/naminodarie/SourceExpander