# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94462 | AntonioDaki | Akcija (COCI15_akcija) | C++14 | 17 ms | 1656 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::sync_with_stdio(0);
cin.tie(0);
long long n, c[100002], x = 0;
cin >> n;
for(long long i = 0; i < n; ++i) cin >> c[i];
sort(c, c + n);
for(long long i = n - 1; i >= 2; i -= 3) x += c[i] + c[i - 1];
if(n % 3 == 2) x += c[0] + c[1];
else if(n % 3) x += c[0];
cout << x;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |