제출 #964279

#제출 시각아이디문제언어결과실행 시간메모리
964279PringAkcija (COCI15_akcija)C++17
80 / 80
13 ms1796 KiB
#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 timeMemoryGrader output
Fetching results...