#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;


#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 1e5 + 20;
LL a[maxn];
map<LL, int>book;
LL n, k;
bool check(LL val) {
    LL total = 0;
    for (int i = 1; i <= n; ++i) {
        LL dis = val - a[i];
        if (val < 2 * a[i]) break;
        if (dis >= a[n]) {
            total += n - i;
        } else {
            int pos = upper_bound(a + 1, a + 1 + n, dis) - a;
            total += pos - 1 - i;
        }
        if (total >= k) return true;
    }
////    cout << total << endl;
//    if (total > k) return true;
    return false;
}
void work() {
    IOS;
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
//    cout << check(7) << endl;
    LL be = a[1] + a[2];
    LL en = a[n] + a[n - 1];
    assert(be <= en);
//    cout << check(0) << endl;
    while (be <= en) {
        LL mid = (be + en) >> 1;
        if (check(mid)) {
            en = mid - 1;
        } else be = mid + 1;
    }
//    assert(be <= a[n] + a[n - 1]);
    cout << be << endl;
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    work();
    return 0;
}