#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "nile.h"
const ll INF = 1e14;
vl calculate_costs(vi W, vi A, vi B, vi E) {
int n = W.size();
V<ti> itm(n);
ll sm = 0;
f0r(i, n) {
itm[i] = {W[i], A[i], B[i]};
sm += A[i];
}
cout << sm << endl;
sort(all(itm));
int Q = E.size();
vl R(Q, 0);
f0r(t, Q) {
int D = E[t];
V<array<ll, 3>> dp(n, {INF, INF, INF});
dp[0][0] = get<1>(itm[0]);
fnr(i, 1, n) {
auto [w, a, b] = itm[i];
auto [w1, a1, b1] = itm[i-1];
dp[i][0] = *min_element(all(dp[i-1])) + a;
if (w - w1 <= D) dp[i][1] = b + b1 + dp[i-1][0] - a1;
if (i > 1) {
auto [w2, a2, b2] = itm[i-2];
if (w - w2 <= D) {
dp[i][2] = b2 + b;
ll x = i > 2 ? *min_element(all(dp[i-3])) + a1 : a1;
if (i > 2) {
auto [w3, a3, b3] = itm[i-3];
if (w1- w3 <= D) x = min(x, dp[i-3][0] - a3 + b3 + b1);
}
dp[i][2] += x;
}
}
}
R[t] = *min_element(all(dp[n-1]));
}
return R;
}
