#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int MAX_N = 100010;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)

int n, m;
int a[MAX_N];

bool C(int index){
    ll score = a[0] + a[index];
    priority_queue<int> que;
    for (int i = 1; i < n; i++){
        if (i != index) que.push(a[i]);
    }

    vector<ll> v;
    while(que.size()){
        ll x = que.top(); que.pop();
        x += que.top(); que.pop();
        v.push_back(x);
    }

    int ng = -1;
    int ok = (int)v.size();
    while(abs(ok - ng) > 1){
        int mid = (ok + ng) / 2;
        if (v[mid] <= score) ok = mid;
        else ng = mid; 
    }

    if (ok < m) return true;
    else return false;
}

int main(){
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a + 1, a + n);

    a[n] = -1;

    int ng = 0;
    int ok = n;
    while(abs(ok - ng) > 1){
        int mid = (ok + ng) / 2;
        if (C(mid)) ok = mid;
        else ng = mid;
    }
    
    cout << a[ok] << endl;

    return 0;
}