# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
258051 |
2020-08-05T09:16:40 Z |
NONAME |
Akcija (COCI15_akcija) |
C++14 |
|
19 ms |
1280 KB |
#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 |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
14 ms |
1152 KB |
Output is correct |
7 |
Correct |
9 ms |
1152 KB |
Output is correct |
8 |
Correct |
9 ms |
1152 KB |
Output is correct |
9 |
Correct |
18 ms |
1280 KB |
Output is correct |
10 |
Correct |
19 ms |
1280 KB |
Output is correct |