oj.uz

Submission #154215

# Submission time Handle Problem Language Result Execution time Memory
154215 2019-09-19T10:48:07 Z KCSC Akcija (COCI15_akcija) C++14
80 / 80
 59 ms 1272 KB 
#include <bits/stdc++.h>
using namespace std;

const int DIM = 100005;

int arr[DIM];

int main(void) {
   // freopen("b.in", "r", stdin);
   // freopen("b.out", "w", stdout);
    int n;
    cin >> n;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
        ans += arr[i];
    }
    sort(arr + 1, arr + n + 1);
    for (int i = n - 2; i >= 1; i -= 3)
        ans -= arr[i];
    cout << ans;
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 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 1144 KB Output is correct
7 Correct 41 ms 1144 KB Output is correct
8 Correct 43 ms 1144 KB Output is correct
9 Correct 59 ms 1272 KB Output is correct
10 Correct 59 ms 1272 KB Output is correct