oj.uz

Submission #1101215

# Submission time Handle Problem Language Result Execution time Memory
1101215 2024-10-15T18:47:43 Z bvv23 Akcija (COCI15_akcija) C++17
80 / 80
 12 ms 1636 KB 
// Ahmadov orz
/// successful failure
#include <bits/stdc++.h>
/// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
/// using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define drop(x) cout<<x<<endl;return
// template <class T>
// using isTree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/// sometimes you gotta think simple
struct custom_hash {
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        x ^= FIXED_RANDOM;
        return x ^ (x >> 16);
    }
};
void failure()
{
    int n;
    cin >> n;
    vector <int> arr(n);
    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        sum += arr[i];
    }
    sort(all(arr));
    reverse(all(arr));
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (i % 3 == 2) {
            ans += arr[i];
        }
    }
    drop(sum - ans);
}
signed main() { 
    ios_base::sync_with_stdio(0); 
    cin.tie(NULL);                
    cout.tie(NULL);
    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        failure();
    }
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 560 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 8 ms 1636 KB Output is correct
8 Correct 6 ms 1620 KB Output is correct
9 Correct 12 ms 1620 KB Output is correct
10 Correct 12 ms 1620 KB Output is correct