# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1210059 | sula2 | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define popcount(x) __builtin_popcountll(x)
using namespace std;
using namespace chrono;
long long delivery(int n, int k, int l, int* positions) {
int mx = 0, mn = l;
for (int i = 0; i < n; i++) {
mx = max(mx, positions[i]);
mn = min(mn, positions[i]);
}
return min({
mx*2,
2*(l - mn),
l
});
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a[] = {1, 2, 5};
cout << delivery(3, 3, 8, a);
}