P2094运输

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
using namespace std;
priority_queue <int,vector<int>,less<int> > q;
//bool operator  < (int x,int y){
//    return x>y;
//};
int n,k;
int x;
int main(){
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;++i){
        cin>>x;        
        q.push(x);
    }
    while(1){
        int x=q.top();
        q.pop();
        int y=q.top();
        q.pop();
        q.push((x+y)/k);
        if(q.size()==1){
            cout<<q.top();
            return 0;
        }
        
    }
    return 0;
}