# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382928 | victoriad | Akcija (COCI15_akcija) | C++14 | 18 ms | 748 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <fstream>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int>c(n);
for(int i=0;i<n;i++){
cin>>c[i];
}
sort(c.rbegin(),c.rend());
int r=0,y;
if(n%3==0){
y=n;
}
else if(n%3==1){
y=n-1;
r=c[n-1];
}
else{
y=n-2;
r=c[n-1]+c[n-2];
}
for(int i=0;i<y/3;i++){
r+=c[i*3]+c[i*3+1];
}
cout<<r;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |