| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1305171 | mary-_-bogdanova | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include "boxes.h"
#include <algorithm>
using ll = long long;
ll delivery(int N, int K, int L, int p[]) {
if (K == 1) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += min(p[i], L - p[i]);
}
return ans;
}
return 0;
}
