# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54041 | robert | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
using namespace std;
int dtz(int a, int L){
return min(a, L-a);
}
int delivery(int N, int K, int L, int *p){
p[N] = 0;
sort(p, p+N);
p[N+1] = 0;
long long ans = 0;
for(int n=0; n<=N; n++){
ans = min(ans, a[n] + (L-a[n+1]));
}
return ans;
}