oj.uz

Submission #838657

# Submission time Handle Problem Language Result Execution time Memory
838657 2023-08-27T14:17:55 Z vjudge1 Akcija (COCI15_akcija) C++17
80 / 80
 12 ms 980 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000005
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mid (start+end)/2

int32_t main(){
    faster
    int n;cin>>n;
    int dizi[n];
    for(int i=0;i<n;i++)cin>>dizi[i];
    sort(dizi,dizi+n);
    int cev=0;
    int tut=n%3;
    for(int i=0;i<tut;i++)cev+=dizi[i];
    //cout<<cev<<endl;
    for(int i=tut;i<n;i++){
        if(i%3==tut)continue;
        cev+=dizi[i];
    }
    cout<<cev<<'\n';
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 980 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 12 ms 980 KB Output is correct
10 Correct 12 ms 980 KB Output is correct