Submission #165220

# Submission time Handle Problem Language Result Execution time Memory
165220 2019-11-26T06:11:52 Z egekabas Akcija (COCI15_akcija) C++14
80 / 80
38 ms 1656 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n;
ll a[100009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i < n; ++i)
        cin >> a[i];
    sort(a, a+n, greater<ll>());
    ll ans = 0;
    for(ll i = 0; i < n; ++i){
        if(i % 3 != 2)
            ans += a[i];
    }
    cout << ans << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 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 348 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 38 ms 1528 KB Output is correct
7 Correct 13 ms 1532 KB Output is correct
8 Correct 12 ms 1532 KB Output is correct
9 Correct 22 ms 1656 KB Output is correct
10 Correct 22 ms 1656 KB Output is correct