#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;
// subtask 1
vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
ll q = e.size();
ll n = w.size();
vector<ll> ans(q);
vector<ll> c(n);
ll sum = 0;
for (int i = 0; i < n; ++i) {
c[i] = a[i] - b[i];
sum += b[i];
}
sort(c.begin(), c.end());
for (ll x = 0; x < q; ++x) {
ll res = sum;
if (n & 1) res += c[0];
ans[x] = res;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |