#include "meeting.h"
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;
const ll inf=1e18;

long long min_charge(int K, vector<int> s, vector<int> e, vector<int> w) 
{
    ll n=sz(w);
    vector <ll> num;
    for (ll i=0; i<n; i++)
        num.pb(s[i]), num.pb(e[i]);
    sort(num.begin(), num.end());
    num.resize(unique(num.begin(), num.end())-num.begin());
    ll k=sz(num);
    vector <ll> dp(k+1, inf); dp[0]=0;
    vector <vector <pll>> H(k+1);
    for (ll i=0; i<n; i++)
    {
        s[i]=lower_bound(num.begin(), num.end(), s[i])-num.begin()+1;
        e[i]=lower_bound(num.begin(), num.end(), e[i])-num.begin()+1;
        H[e[i]].pb({s[i], w[i]});
    }
    vector <ll> cnt(k+1, 0);
    vector <priority_queue<ll, vector <ll>, greater<ll>>> q(k+1); 
    for (ll i=1; i<=k; i++)
    {
        for (auto [l, w]:H[i])
        {
            for (ll j=0; j<=l-1; j++)
            {
                q[j].push(w);
                if (sz(q[j])>K)
                    cnt[j]+=q[j].top(), q[j].pop();
            }
            for (ll j=l; j<i; j++) cnt[j]+=w;
        }
        for (ll j=0; j<=i; j++)
            dp[i]=min(dp[i], dp[j]+cnt[j]);
    }
    return dp[k];
}