#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,cap,sum;
int main()
{
    fin>>n;
    fin>>k;
    int slt[n+1];
    for(int i=1;i<=n;i++){
      fin>>slt[i];
    }
    for(int i=1;i<=n;i++){
      sum=sum+slt[i];
    }
    if(sum%k==0){
      cap=sum/k;
    }else {
    cap=sum/k+1;
    }
    fout<<cap+1;
    return 0;
}