DMOJ · ccc26j2

CCC 2026 J2 CCC '26 J2 - Olympic Scores

This C++ solution uses sorting & greedy for CCC 2026 J2 CCC '26 J2 - Olympic Scores. Read the reasoning, inspect the code, or try your own test case below.

ccc26j2CCC 2026 J2Sorting & searchingSorting & greedyC++17 lines
Solution154of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Olympic Scores removes one minimum and maximum among five scores, sums the rest, and multiplies by difficulty; the code matches.

Sorting & searching

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

J_2_Olympic_Scores.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1LL << 60; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        vector<int> a(5);
        for (int i = 0; i < 5; i++) cin >> a[i];
        sort(a.begin(), a.end());
        int ans = 0;
        for (int i = 1; i < 4; i++) ans += a[i];
        int d; cin >> d;
        cout << ans * d << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.