Submission #1265679

#TimeUsernameProblemLanguageResultExecution timeMemory
1265679alexiahBoxes with souvenirs (IOI15_boxes)C++20
0 / 100
0 ms324 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; long long delivery(int n, int k, int l, int p[]) { int ans = 0; int aux1 = 0 , aux2 = INT_MAX; for(ll i = 0; i < n; i++){ aux1 = max(aux1 , p[i]); aux2 = min(aux2 , p[i]); } ans += min(aux1 , aux2); 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...