# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132286 | 2019-07-18T16:17:25 Z | reda | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #define MIN(a,b) ((a) < (b) ? (a) : (b)) #include"boxes.h" using namespace std ; long long delivery( long long n , long long k , long long l , long long pos[]) { if(k==1){ vector<long long > arr(n); for(long long i=0;i<n;i++) { arr[i]=MIN(-pos[i]+l , pos[i] ); } int c=0; while (*min_element(arr.begin(),arr.end())!= (long long)1e18) { //cout<<*min_element(pos.begin(),pos.end())<<endl; c+=*min_element(arr.begin(),arr.end())*2; *min_element(arr.begin(),arr.end())=(long long )1e18; } return c; } return 0; }