[第1章 1.4t8] 荷马史诗

#include 
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair pll;
int main(){
    ll n,k;
    cin>>n>>k;
    priority_queue,greater<>> pq;
    for(ll i=1;i<=n;i++){
        ll w;
        cin>>w;
        pq.push({w,0});
    }
    ll ans=0;
    ll ma=0;
    while((pq.size()-1)%(k-1)!=0)pq.push({0,0});
    while(pq.size()>1){
        ll tmp=0;
        ll h=0;
        for(ll i=0;i