oj.uz

Submission #153872

# Submission time Handle Problem Language Result Execution time Memory
153872 2019-09-17T06:08:49 Z vladciuperceanu Akcija (COCI15_akcija) C++14
80 / 80
 62 ms 808 KB 
#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;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 45 ms 720 KB Output is correct
7 Correct 41 ms 632 KB Output is correct
8 Correct 41 ms 760 KB Output is correct
9 Correct 59 ms 808 KB Output is correct
10 Correct 62 ms 632 KB Output is correct