# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
898493 |
2024-01-04T18:36:07 Z |
Blagoj |
Akcija (COCI15_akcija) |
C++17 |
|
12 ms |
1372 KB |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a.begin() + 1, a.end());
reverse(a.begin() + 1, a.end());
int sum = 0;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0) continue;
sum += a[i];
}
cout << sum;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
10 ms |
1132 KB |
Output is correct |
7 |
Correct |
9 ms |
1236 KB |
Output is correct |
8 |
Correct |
6 ms |
1112 KB |
Output is correct |
9 |
Correct |
12 ms |
1372 KB |
Output is correct |
10 |
Correct |
12 ms |
1368 KB |
Output is correct |