#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef pair<int, int> pi;
typedef long long ll;
long long int min_charge(int K, vector<int> S, vector<int>E, vector<int>W) {
    int n, k;
    n = S.size();
    k = K;
    vector<array<ll, 3>>v(n);
    for (int i = 0; i < n; i++) {
        v[i] = { S[i],E[i],W[i] };
    }
    sort(v.begin(), v.end());
    vector<priority_queue<ll, vector<ll>, greater<ll>>>pq(n);
    vector<ll>d(n);
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (v[i][1] >= v[j][1]) {
                pq[i].push(v[j][2]);
                d[i] += v[j][2];
                if (pq[i].size() > k) {
                    d[i] -= pq[i].top();
                    pq[i].pop();
                }
            }
        }
    }
    vector<int>a(n);
    for (int i = 0; i < n; i++) a[i] = i;
    for (int i = 0; i < n; i++) {
        auto& cur = v[i];
        sum += cur[2];
        int e = i - 1;
        multiset<ll, greater<ll>>s;
        s.insert(0);
        for (int j = 0; j < i; j++) s.insert(d[j]);
        ll mx = d[i];
        for (int j = i; j >= 0; j--) {
            if (v[j][1] < cur[0]) break;
            if (v[j][1] > v[i][1]) continue;
            while (e >= 0 && v[a[e]][1] >= v[j][0]) {
                auto it = s.find(d[a[e--]]);
                s.erase(it);
            }
            ll base = *s.begin();
            pq[i].push(v[j][2]);
            d[i] += v[j][2];
            if (pq[i].size() > k) {
                d[i] -= pq[i].top();
                pq[i].pop();
            }
            mx = max(mx, d[i] + base);
        }
        d[i] = mx;
        sort(a.begin(), a.begin() + i, [&](int x, int y)->bool {
            return v[x][1] < v[y][1];
            });
        //cout<<i<<" : "<<mx<<"\n";
    }
    ll ans = 0;
    for (auto i : d) ans = max(ans, i);
    return sum - ans;
}