| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331216 | superiormaku | 선물상자 (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
long long delivery(long long N, long long K, long long L, long long positions[]){
long long mintime = 0;
for(int i = 0; i < N; i++){
mintime = mintime + min(L - positions[i], positions[i]);
}
cout << mintime * 2;
return mintime * 2;
}