codeforce 604B More Cowbell

题意：n个球，分成k堆。问堆的最大值的最小。

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
        ll n, m, aa[111111];
        scanf("%I64d %I64d", &n, &m);
        for(ll i = 1 ; i <= n ; i ++)
                scanf("%I64d", &aa[i]);
        ll a = m * 2 - n, mx = aa[n];
        for(int i = 1 ; i <= n - a ; i ++){
                mx = max(mx, aa[i] + aa[n - a - i + 1]);
        }
        printf("%I64d", mx);
        return 0;
}