# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444480 | fuad27 | 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<bits/stdc++.h>
#include "boxes.h"
using namespace std;
long long subtask1(int N,int L, int p[]) {
long long sum = 0;
for(int i = 0;i<N;i++) {
sum += min(p[i], L-p[i])*2;
}
return sum;
}
long long delivery(int N, int K, int L, int p[]) {
if(K == 1) {
sort(p, p+N);
return subtask1(N,L,p);
}
return 0;
}
int main () {
int p[2] = {1, 3};
cout<<delivery(2, 1, 4, p);
return 0;
}