# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931888 | hugsfromadicto | Akcija (COCI15_akcija) | C++14 | 13 ms | 1808 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 1e5 + 1;
int a[mxN], b[mxN];
void _()
{
int n;
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i];
sort(a,a + n, greater<int>());
int sum = 0;
for(int i = 0; i < n; ++i)
{
if(i % 3 == 0 or i % 3 == 1)
sum += a[i];
}
cout << sum;
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while(tc--)
{
_();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |