# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
999588 |
2024-06-15T20:52:31 Z |
May27_th |
Akcija (COCI15_akcija) |
C++17 |
|
13 ms |
1504 KB |
#include<bits/stdc++.h>
using namespace std;
#define int64_t long long
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
void Solve(void) {
int N; cin >> N;
vector<int> a;
int64_t ans = 0;
for (int i = 1; i <= N; i ++) {
int x; cin >> x;
a.pb(x);
ans += x;
}
// cout << ans << "\n";
sort(a.rbegin(), a.rend());
for (int i = 2; i < N; i += 3) {
ans -= a[i];
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int Tests = 1; // cin >> Tests;
while (Tests --) {
Solve();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 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 |
1244 KB |
Output is correct |
7 |
Correct |
6 ms |
1396 KB |
Output is correct |
8 |
Correct |
6 ms |
1500 KB |
Output is correct |
9 |
Correct |
12 ms |
1504 KB |
Output is correct |
10 |
Correct |
13 ms |
1504 KB |
Output is correct |