{"problem":{"name":"Gift Tax","description":{"content":"You are given positive integers $a$ and $b$ such that $a\\leq b$, and a sequence of positive integers $A = (A_1, A_2, \\ldots, A_N)$. On this sequence, you can perform the following operation any number","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc144_b"},"statements":[{"statement_type":"Markdown","content":"You are given positive integers $a$ and $b$ such that $a\\leq b$, and a sequence of positive integers $A = (A_1, A_2, \\ldots, A_N)$.\nOn this sequence, you can perform the following operation any number of times (possibly zero):\n\n*   Choose distinct indices $i, j$ ($1\\leq i, j \\leq N$). Add $a$ to $A_i$ and subtract $b$ from $A_j$.\n\nFind the maximum possible value of $\\min(A_1, A_2, \\ldots, A_N)$ after your operations.\n\n## Constraints\n\n*   $2\\leq N\\leq 3\\times 10^5$\n*   $1\\leq a\\leq b\\leq 10^9$\n*   $1\\leq A_i\\leq 10^{9}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $a$ $b$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc144_b","tags":[],"sample_group":[["3 2 2\n1 5 9","5\n\nHere is one way to achieve $\\min(A_1, A_2, A_3) = 5$.\n\n*   Perform the operation with $i = 1, j = 3$. $A$ becomes $(3, 5, 7)$.\n*   Perform the operation with $i = 1, j = 3$. $A$ becomes $(5, 5, 5)$."],["3 2 3\n11 1 2","3\n\nHere is one way to achieve $\\min(A_1, A_2, A_3) = 3$.\n\n*   Perform the operation with $i = 1, j = 3$. $A$ becomes $(13, 1, -1)$.\n*   Perform the operation with $i = 2, j = 1$. $A$ becomes $(10, 3, -1)$.\n*   Perform the operation with $i = 3, j = 1$. $A$ becomes $(7, 3, 1)$.\n*   Perform the operation with $i = 3, j = 1$. $A$ becomes $(4, 3, 3)$."],["3 1 100\n8 5 6","5\n\nYou can achieve $\\min(A_1, A_2, A_3) = 5$ by not performing the operation at all."],["6 123 321\n10 100 1000 10000 100000 1000000","90688"]],"created_at":"2026-03-03 11:01:14"}}