# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
964279 |
2024-04-16T14:30:39 Z |
Pring |
Akcija (COCI15_akcija) |
C++17 |
|
13 ms |
1796 KB |
#include <bits/stdc++.h>
using namespace std;
#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;
const int MXN = 100005;
int n;
ll a[MXN];
void miku() {
cin >> n;
FOR(i, 1, n + 1) cin >> a[i];
sort(a + 1, a + n + 1, greater<ll>());
ll ans = 0;
FOR(i, 1, n + 1) if (i % 3) ans += a[i];
cout << ans << '\n';
}
int32_t main() {
cin.tie(0) -> sync_with_stdio(false);
cin.exceptions(cin.failbit);
miku();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
10 ms |
1624 KB |
Output is correct |
7 |
Correct |
7 ms |
1628 KB |
Output is correct |
8 |
Correct |
6 ms |
1624 KB |
Output is correct |
9 |
Correct |
13 ms |
1796 KB |
Output is correct |
10 |
Correct |
12 ms |
1624 KB |
Output is correct |