{"problem":{"name":"Divide the Problems","description":{"content":"Takahashi made $N$ problems for competitive programming. The problems are numbered $1$ to $N$, and the difficulty of Problem $i$ is represented as an integer $d_i$ (the higher, the harder). He is divi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc132_c"},"statements":[{"statement_type":"Markdown","content":"Takahashi made $N$ problems for competitive programming. The problems are numbered $1$ to $N$, and the difficulty of Problem $i$ is represented as an integer $d_i$ (the higher, the harder).\nHe is dividing the problems into two categories by choosing an integer $K$, as follows:\n\n*   A problem with difficulty $K$ or higher will be _for ARCs_.\n*   A problem with difficulty lower than $K$ will be _for ABCs_.\n\nHow many choices of the integer $K$ make the number of problems for ARCs and the number of problems for ABCs the same?\n\n*   $2 \\leq N \\leq 10^5$\n*   $N$ is an even number.\n*   $1 \\leq d_i \\leq 10^5$\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$d_1$ $d_2$ $...$ $d_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc132_c","tags":[],"sample_group":[["6\n9 1 4 4 6 7","2\n\nIf we choose $K=5$ or $6$, Problem $1$, $5$, and $6$ will be for ARCs, Problem $2$, $3$, and $4$ will be for ABCs, and the objective is achieved. Thus, the answer is $2$."],["8\n9 1 14 5 5 4 4 14","0\n\nThere may be no choice of the integer $K$ that make the number of problems for ARCs and the number of problems for ABCs the same."],["14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1","42685"]],"created_at":"2026-03-03 11:01:14"}}