codeforce 604B More Cowbell

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

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