{"problem":{"name":"Successive Subtraction","description":{"content":"There are $N$ integers, $A_1, A_2, ..., A_N$, written on a blackboard. We will repeat the following operation $N-1$ times so that we have only one integer on the blackboard. *   Choose two integers $","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"diverta2019_2_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ integers, $A_1, A_2, ..., A_N$, written on a blackboard.\nWe will repeat the following operation $N-1$ times so that we have only one integer on the blackboard.\n\n*   Choose two integers $x$ and $y$ on the blackboard and erase these two integers. Then, write a new integer $x-y$.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^5$\n*   $-10^4 \\leq A_i \\leq 10^4$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"diverta2019_2_c","tags":[],"sample_group":[["3\n1 -1 2","4\n-1 1\n2 -2\n\nIf we choose $x = -1$ and $y = 1$ in the first operation, the set of integers written on the blackboard becomes $(-2, 2)$.\nThen, if we choose $x = 2$ and $y = -2$ in the second operation, the set of integers written on the blackboard becomes $(4)$.\nIn this case, we have $4$ as the final integer. We cannot end with a greater integer, so the answer is $4$."],["3\n1 1 1","1\n1 1\n1 0"]],"created_at":"2026-03-03 11:01:14"}}