{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou have an array $$$w_1, w_2, \\ldots, w_n$$$ of length $$$n$$$.\u003c/p\u003e\u003cp\u003eYou need to choose a subsequence of $$$k$$$ elements. Let their indices be $$$1 \\leq i_1 \u0026lt; i_2 \u0026lt; \\ldots \u0026lt; i_k \\leq n$$$.\u003c/p\u003e\u003cp\u003eYour goal is to find the minimum possible value of $$$$$$\\max \\left( (w_{i_1} + w_{i_2}), (w_{i_2} + w_{i_3}), \\ldots, (w_{i_{k - 1}} + w_{i_k}), (w_{i_k} + w_{i_1}) \\right)$$$$$$ among all such subsequences.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of input contains two integers $$$n$$$ and $$$k$$$: the number of elements in the array $$$w$$$ and the length of subsequence ($$$3 \\leq k \\leq n \\leq 200\\,000$$$).\u003c/p\u003e\u003cp\u003eThe second line contains $$$n$$$ space-separated integers $$$w_1, w_2, \\ldots, w_n$$$ ($$$1 \\leq w_i \\leq 10^9$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePrint one integer: the minimum possible value of $$$$$$\\max \\left( (w_{i_1} + w_{i_2}), (w_{i_2} + w_{i_3}), \\ldots, (w_{i_{k - 1}} + w_{i_k}), (w_{i_k} + w_{i_1}) \\right)$$$$$$ among all subsequences of length $$$k$$$.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 3\n17 18 17 30 35\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e35\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}