#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include <stdio.h>
#include <queue>

#define LL long long
#define pb push_back
#define lm 1300000
#define MOD 1000000007

using namespace std;
int n,k,x,res,mx=0;
long int sum;
int main()
{
    freopen("transport.in", "r", stdin);
    freopen("transport.out","w",stdout);
    scanf("%d %d",&n,&k);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&x);
        sum+=x;
        mx=max(x,mx);
    }
    if(k<n)
    {
        res=sum/k;
        res+=sum%k;
    }
    else
    {
        res=mx;
    }
    cout<<res;
    return 0;
}