{"problem":{"name":"Binomial Coefficients","description":{"content":"Let ${\\rm comb}(n,r)$ be the number of ways to choose $r$ objects from among $n$ objects, disregarding order. From $n$ non-negative integers $a_1, a_2, ..., a_n$, select two numbers $a_i > a_j$ so tha","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc095_b"},"statements":[{"statement_type":"Markdown","content":"Let ${\\rm comb}(n,r)$ be the number of ways to choose $r$ objects from among $n$ objects, disregarding order. From $n$ non-negative integers $a_1, a_2, ..., a_n$, select two numbers $a_i > a_j$ so that ${\\rm comb}(a_i,a_j)$ is maximized. If there are multiple pairs that maximize the value, any of them is accepted.\n\n## Constraints\n\n*   $2 \\leq n \\leq 10^5$\n*   $0 \\leq a_i \\leq 10^9$\n*   $a_1,a_2,...,a_n$ are pairwise distinct.\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":"arc095_b","tags":[],"sample_group":[["5\n6 9 4 2 11","11 6\n\n$\\rm{comb}(a_i,a_j)$ for each possible selection is as follows:\n\n*   $\\rm{comb}(4,2)=6$\n*   $\\rm{comb}(6,2)=15$\n*   $\\rm{comb}(6,4)=15$\n*   $\\rm{comb}(9,2)=36$\n*   $\\rm{comb}(9,4)=126$\n*   $\\rm{comb}(9,6)=84$\n*   $\\rm{comb}(11,2)=55$\n*   $\\rm{comb}(11,4)=330$\n*   $\\rm{comb}(11,6)=462$\n*   $\\rm{comb}(11,9)=55$\n\nThus, we should print $11$ and $6$."],["2\n100 0","100 0"]],"created_at":"2026-03-03 11:01:14"}}