# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283494 | JoseCopas | Boxes with souvenirs (IOI15_boxes) | C++17 | 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 "boxes.h"
#include "bits/stdc++.h"
using namespace std;
int delivery(int N, int K, int L, int p[])
{
int c=0;
if(K==1)
{
sort(p, p+N);
for(int i=0;i<N;i++)
{
//cout<<p[i]<<" ";
c+=min(L-p[i], p[i]);
}
}
return c;
}
/*
int main()
{
int n,k,l;
cin>>n>>k>>l;
int v[n];
for(int i=0;i<n;i++)cin>>v[i];
delivery(n,k,l,v);
}
*/