using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, m) = (c[0], c[1]); var a = NN; var other = new List(n - 1); for (var i = 0; i + 1 < n; ++i) other.Add(NN); other.Sort(); if (!Check(m, a, other, n - 2)) { WriteLine(-1); return; } var ok = n - 2; var ng = -1; while (ok - ng > 1) { var mid = (ok + ng) / 2; if (Check(m, a, other, mid)) ok = mid; else ng = mid; } WriteLine(other[ok]); } static bool Check(int m, int a, List other, int bid) { var sum = a + other[bid]; var rest = new List(other.Count - 1); for (var i = 0; i < other.Count; ++i) if (i != bid) rest.Add(other[i]); var left = 0; var over = 0; for (var r = rest.Count - 1; r >= 0; --r) { while (left < r && rest[left] + rest[r] <= sum) ++left; if (left >= r) break; ++over; ++left; } return over < m; } }