{"problem":{"name":"Minimize Abs 1","description":{"content":"You are given an integer sequence $A=(A_1,A_2,\\ldots,A_N)$ of length $N$ and integers $L$ and $R$ such that $L\\leq R$. For each $i=1,2,\\ldots,N$, find the integer $X_i$ that satisfies both of the foll","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc330_b"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence $A=(A_1,A_2,\\ldots,A_N)$ of length $N$ and integers $L$ and $R$ such that $L\\leq R$.\nFor each $i=1,2,\\ldots,N$, find the integer $X_i$ that satisfies both of the following conditions. Note that the integer to be found is always uniquely determined.\n\n*   $L\\leq X_i \\leq R$.\n*   For every integer $Y$ such that $L \\leq Y \\leq R$, it holds that $|X_i - A_i| \\leq |Y - A_i|$.\n\n## Constraints\n\n*   $1\\leq N\\leq 2\\times 10^5$\n*   $1\\leq L\\leq R \\leq 10^9$\n*   $1\\leq A_i\\leq 10^9$\n*   All input values are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $L$ $R$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc330_b","tags":[],"sample_group":[["5 4 7\n3 1 4 9 7","4 4 4 7 7\n\nFor $i=1$:\n\n*   $|4-3|=1$\n*   $|5-3|=2$\n*   $|6-3|=3$\n*   $|7-3|=4$\n\nThus, $X_i = 4$."],["3 10 10\n11 10 9","10 10 10"]],"created_at":"2026-03-03 11:01:14"}}