{"problem":{"name":"E. New Max","description":{"content":"Kamal 'D has an array of size $N$. He can do at most $K$ operations on it, in each operation he can choose any element in the array and change its value to any other value $X$, $(1 <= x <= 400)$. Ka","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10203E"},"statements":[{"statement_type":"Markdown","content":"Kamal 'D has an array of size $N$.\n\nHe can do at most $K$ operations on it, in each operation he can choose any element in the array and change its value to any other value $X$, $(1 <= x <= 400)$.\n\nKamal 'D wants to know if he can make the maximum element in the new array equal to $M$.\n\nThe first line of input will contain 3 integers $N$, $M$ and $K$ $(1 <= N <= 400)$ $(0 <= K <= 400)$ $(1 <= M <= 400)$ which are the size of the array, the new maximum value and the number of operations.\n\nThe second line will contain $n$ integers, the $i_{t h}$ one is $a_i$ which is the $i_t h$ element in array $a$, $(1 <= a_i <= 400)$\n\nFor each test case, print \"YES\" if Kamal 'D can make the maximum element equals to M, print \"NO\" otherwise .\n\n## Input\n\nThe first line of input will contain 3 integers $N$, $M$ and $K$ $(1 <= N <= 400)$ $(0 <= K <= 400)$ $(1 <= M <= 400)$ which are the size of the array, the new maximum value and the number of operations.The second line will contain $n$ integers, the $i_{t h}$ one is $a_i$ which is the $i_t h$ element in array $a$, $(1 <= a_i <= 400)$\n\n## Output\n\nFor each test case, print \"YES\" if Kamal 'D can make the maximum element equals to M, print \"NO\" otherwise .\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ N, M, K \\in \\mathbb{Z} $ be given integers with $ 1 \\leq N \\leq 400 $, $ 0 \\leq K \\leq 400 $, $ 1 \\leq M \\leq 400 $.  \nLet $ A = (a_1, a_2, \\dots, a_N) $ be a sequence of integers with $ 1 \\leq a_i \\leq 400 $ for all $ i $.\n\n**Constraints**  \nEach operation allows changing any element $ a_i $ to any value $ x \\in [1, 400] $.  \nAt most $ K $ operations may be performed.\n\n**Objective**  \nDetermine whether it is possible to perform at most $ K $ operations such that the maximum element of the resulting array is exactly $ M $, i.e.,  \n$$\n\\max_{1 \\leq i \\leq N} a_i' = M\n$$  \nwhere $ a_i' $ is the value of the $ i $-th element after operations.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10203E","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}