# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145989 | grobar | Akcija (COCI15_akcija) | C++14 | 60 ms | 760 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 <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int mod=n%3;
int sum=0;
for(int i=(n-1);i>0;i=i-3)
{
sum=sum+a[i]+a[i-1];
//cout<<sum<<" "<<a[i]<<" "<<a[i-1]<<endl;
}
if(mod==1)
{
sum=sum+a[0];
}
cout<<sum<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |