#include "boxes.h" #include <algorithm> long long delivery(int N, int K, int L, int p[]) { auto dist = [&](long long x) { return std::min(x, (long long)L - x); }; long long ans = 0; if (K == 1) for (int i = 0; i < N; ++i) ans += 2LL * std::max(0ll, dist(p[i])); else if (K == N) { long long mx = 0; for (int i = 0; i < N; ++i) mx = std::max(mx, (long long)dist(p[i])); ans = 2LL * (mx); } return ans; }