# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153848 | Ruxandra985 | Akcija (COCI15_akcija) | C++14 | 23 ms | 1272 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 <cstdio>
#include <algorithm>
#include <set>
using namespace std;
int v[100010];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n,i;
long long sol = 0;
fscanf (fin,"%d",&n);
for (i=1;i<=n;i++)
fscanf(fin,"%d",&v[i]);
sort ( v + 1 , v + n + 1);
for (i=n;i>0;i-=3){
if (i - 2>0)
sol = sol + v[i] + v[i-1];
else{
sol = sol + v[i];
if (i-1>0)
sol = sol + v[i-1];
}
}
fprintf (fout,"%lld",sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |