oj.uz

Submission #165227

# Submission time Handle Problem Language Result Execution time Memory
165227 2019-11-26T06:22:52 Z Atill83 Akcija (COCI15_akcija) C++14
80 / 80
 39 ms 1164 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int a[MAXN];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    sort(a, a + n);

    ll ans = 0;
    for(int i = n - 1; i >= 0; i-=3){
        if(i < 2){
            ans += a[i] + (i > 0 ? a[i - 1]: 0);
        }else{
            ans += a[i] + a[i - 1];
        }
    }
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 18 ms 1144 KB Output is correct
7 Correct 39 ms 1144 KB Output is correct
8 Correct 12 ms 1164 KB Output is correct
9 Correct 21 ms 760 KB Output is correct
10 Correct 28 ms 1144 KB Output is correct