{"problem":{"name":"Favorite Game","description":{"content":"You are given an integer sequence of length $N$: $A=(A_1,A_2,\\dots,A_N)$. You can perform the following operation any number of times (possibly zero). *   Choose an integer $i$ such that $1 \\le i \\le","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc163_b"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence of length $N$: $A=(A_1,A_2,\\dots,A_N)$. You can perform the following operation any number of times (possibly zero).\n\n*   Choose an integer $i$ such that $1 \\le i \\le N$, and increase or decrease $A_i$ by $1$.\n\nYour goal is to make at least $M$ integers $i(3 \\le i \\le N)$ satisfy $A_1 \\le A_i \\le A_2$. Find the minimum number of operations required to achieve this goal.\n\n## Constraints\n\n*   $3 \\le N \\le 2 \\times 10^5$\n*   $1 \\le M \\le N-2$\n*   $1 \\le A_i \\le 10^9$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc163_b","tags":[],"sample_group":[["3 1\n2 3 5","2\n\nYou can make not less than one integer $i(3 \\le i \\le N)$ satisfy $A_1 \\le A_i \\le A_2$ by performing the operation as follows.\n\n*   Choose $i=3$, and decrease $A_i$ by $1$.\n*   Choose $i=2$, and increase $A_i$ by $1$.\n\nSince it is impossible to achieve the goal with less than $2$ operation, the answer is $2$."],["5 2\n1 4 2 3 5","0\n\nYou may already have achieved the goal from the start."],["8 5\n15 59 64 96 31 17 88 9","35"]],"created_at":"2026-03-03 11:01:13"}}