Codeforces · 2218B

The 67th 6-7 Integer Problem

This C++ solution uses sorting & greedy for Codeforces 2218B The 67th 6-7 Integer Problem. Read the reasoning, inspect the code, or try your own test case below.

2218BSorting & searchingSorting & greedyC++23 lines
Solution213of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

The 67th 6-7 Integer Problem asks to negate six of seven integers; choosing the maximum unnegated gives exactly the code's formula.

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

B_The_67_th_6_7_Integer_Problem.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    void solve() {
        vector<int> v(7);
        for (int i = 0; i < 7; i++) cin >> v[i];
        sort(v.begin(), v.end());
        ll sum = accumulate(v.begin(), v.end(), 0LL);
        sum *= -1;
        sum += v[6] * 2;
        cout << sum << '\n';
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        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.