Submission #444535

#TimeUsernameProblemLanguageResultExecution timeMemory
444535BT21tataBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms204 KiB
#include "boxes.h"
#include<bits/stdc++.h>
typedef long long ll;

using namespace std;

ll ans;

ll delivery(int n, int k, int l, int p[])
{
    sort(p, p+n);
    for(int i=0; i<n; i++)
    {
        ans+=min(p[i]*2, (l-p[i])*2);
    }
    if(k==n) ans=min(l, p[n-1]*2);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...