# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54442 | MoNsTeR_CuBe | 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>
#define int long long
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
int tot = 0;
for(int i = 0; i < N; i++){
int cost = min(p[i], L-p[i]);
tot+=(cost*2);
}
return tot;
}
/*
int main(){
int N, K, L;
cin >> N >> K >> L;
int tab[N];
for(int i = 0; i < N; i++){
cin >> tab[i];
}
cout << delivery(N,K,L,tab) << endl;
}
*/