# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258051 | NONAME | Akcija (COCI15_akcija) | C++14 | 19 ms | 1280 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>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;
const int N = int(1e5) + 500;
int n, a[N];
ll ans = 0;
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < n; i += 3)
for (int j = i; j < min(n, i + 2); ++j)
ans += a[j];
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |