#include"meeting.h"
#include<bits/stdc++.h>
#define reg register
#define int long long
inline bool cmax(reg int &x,reg int y){return x<y?x=y,1:0;}
const int N=3010;
int n,f[N],ans,m,b[N];
std::vector<std::pair<int,int>> vc[N];
#undef int
long long min_charge(int K,std::vector<int> S,std::vector<int> E,std::vector<int> W){
	#define int long long
	n=S.size();
	for (reg int i=0;i<n;i++) b[++m]=S[i],b[++m]=E[i]; std::sort(b+1,b+m+1),m=std::unique(b+1,b+m+1)-b-1;
	for (reg int i=0;i<n;i++) S[i]=std::lower_bound(b+1,b+m+1,S[i])-b,E[i]=std::lower_bound(b+1,b+m+1,E[i])-b;
	for (reg int i=0;i<n;i++) ans+=W[i],vc[S[i]].push_back({E[i],W[i]});
	for (reg int i=1;i<=m;i++){
		std::priority_queue<int,std::vector<int>,std::greater<int>> q;
		reg int S=0;
		for (reg int j=i;j;j--){
			for (auto [r,v]:vc[j]) if (r<=i){
				q.push(v),S+=v;
				if (q.size()>K) S-=q.top(),q.pop();
			}
			cmax(f[i],f[j-1]+S);
		}
	}
	return ans-f[m];
}