#include <bits/stdc++.h>
#include "nile.h"
#define ll long long
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
int N = W.size(), q = E.size();
vector<tuple<int, int, int>> Ws;
vector<ll> ans;
for(int i = 0; i < N; ++i) Ws.emplace_back(W[i], A[i], B[i]);
sort(Ws.begin(), Ws.end());
for(int i = 0; i < N; ++i) W[i] = get<0>(Ws[i]), A[i] = get<1>(Ws[i]), B[i] = get<2>(Ws[i]);
for(int i = 0; i < q; ++i){
int d = E[i];
vector<ll> dp(N+1, LLONG_MAX);
for(int i = 0; i < N; ++i){
if(i == 0) dp[i] = (ll)A[i];
else if(i == 1){
if(W[i] - W[i - 1] <= d) dp[i] = (ll)B[i] + (ll)B[i - 1];
else dp[i] = dp[i - 1] + (ll)A[i];
}
else{
dp[i] = dp[i - 1] + (ll)A[i];
if(W[i] - W[i - 1] <= d) dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)B[i - 1] + dp[i - 2]));
if(W[i] - W[i - 2] <= d){
if(i >= 3) dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)A[i - 1] + (ll)B[i - 2] + dp[i - 3]));
else dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)A[i - 1] + (ll)B[i - 2]));
}
}
}
ans.push_back(dp[N - 1]);
}
return ans;
}
