# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100757 | dalgerok | Akcija (COCI15_akcija) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
long long sum = 0;
int a[n + 1];
for(int i = 1; i <= n; i++){
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + n + 1);
for(int i = n - 2; i - 2 >= 1; i -= 3){
ans -= a[i];
}
cout << sum;
}