| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 153872 | vladciuperceanu | Akcija (COCI15_akcija) | C++14 | 62 ms | 808 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 <iostream>
#include <algorithm>
using namespace std;
int n,i,v[100005];
int main()
{
    cin >> n;
    for (i=1; i<=n; i++)
        cin >> v[i];
    sort(v+1, v+n+1); long long sol = 0;
    int ind = 3+n%3;
    for (i=n; i>=ind; i-=3)
        sol += v[i]+v[i-1];
    if (n%3 == 1)
        sol += v[1];
    if (n%3 == 2)
        sol += v[1]+v[2];
    cout << sol;
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
