# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1217709 | elotelo966 | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
//#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 200005
typedef long long lo;
long long delivery(int N, int K, int L, int p[]) {
lo cev=0;
for(int i=0;i<N;i++){
cev+=min(p[i],L-p[i])*2;
}
return cev;
}
int main(){
faster
int n,k,l;
cin>>n>>k>>l;
int dizi[n];
for(int i=0;i<n;i++)cin>>dizi[i];
cout<<delivery(n,k,l,dizi)<<'\n';
return 0;
}