Codeforces Round #334 (Div. 2) B. More Cowbell

B. More Cowbell

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where there is actually grass instead of corn. Before moving, he must pack his cowbells into k boxes of a fixed size. In order to keep his collection safe during transportation, he won't place more than two cowbells into a single box. Since Kevin wishes to minimize expenses, he is curious about the smallest size box he can use to pack his entire collection.

Kevin is a meticulous cowbell collector and knows that the size of his i-th (1 ≤ i ≤ n) cowbell is an integer si. In fact, he keeps his cowbells sorted by size, so si - 1 ≤ si for any i > 1. Also an expert packer, Kevin can fit one or two cowbells into a box of size s if and only if the sum of their sizes does not exceed s. Given this information, help Kevin determine the smallest s for which it is possible to put all of his cowbells into k boxes of size s.

Input

The first line of the input contains two space-separated integers n and k (1 ≤ n ≤ 2·k ≤ 100 000), denoting the number of cowbells and the number of boxes, respectively.

The next line contains n space-separated integers s1, s2, ..., sn (1 ≤ s1 ≤ s2 ≤ ... ≤ sn ≤ 1 000 000), the sizes of Kevin's cowbells. It is guaranteed that the sizes si are given in non-decreasing order.

Output

Print a single integer, the smallest s for which it is possible for Kevin to put all of his cowbells into k boxes of size s.

Sample test(s)

input

2 1
2 5

output

7

input

4 3
2 3 5 9

output

9

input

3 2
3 5 7

output

8

Note

In the first sample, Kevin must pack his two cowbells into the same box.

In the second sample, Kevin can pack together the following sets of cowbells: {2, 3}, {5} and {9}.

In the third sample, the optimal solution is {3, 5} and {7}.

题意：给你n个物品，每个物品有权值wi（权值按从小到大给出）。让你将这些物品刚好放在k个盒子里（不能有盒子是空的），

而且每个盒子最多只能放两个物品，这两个物品的权值和不能超过盒子的权值。求相同的k个盒子的最小权值是多少

解题思路：

因为最多放两个所以只能是比较 arr[2*(k-1)+1]与 arr[0]，类似。。可推一下。。。

上代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;

#define MM(a) memset(a,0,sizeof(a))

typedef long long LL;
typedef unsigned long long ULL;
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
LL gcd(LL a, LL b)
{
    if(b == 0)
        return a;
    return gcd(b, a%b);
}

int arr[maxn];
int dp[maxn];
int main()
{
    int n, k;
    while(cin>>n>>k)
    {
        for(int i=0; i<n; i++)
            scanf("%d",&arr[i]);
        k = n - k;
        if(k < 0)
        {
            cout<<arr[n-1]<<endl;
            continue;
        }
        int Max = arr[n-1];
        for(int i=0; i<k; i++)
            Max = max(Max, arr[2*k-1-i]+arr[i]);
        cout<<Max<<endl;
    }
    return 0;
}