# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1184939 | InvMOD | Akcija (COCI15_akcija) | C++17 | 21 ms | 584 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
#define ll long long
ll sum = 0; sort(a.begin(), a.end());
for(int i = n - 1, j = 3; i >= 0; i--){
--j;
if(!j){
j = 3;
}
else sum += 1ll * a[i];
}
cout << sum << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |