C++ · Solution

Bob's Rocks

This C++ solution uses simulation for Bob's Rocks. Read the reasoning, inspect the code, or try your own test case below.

Data structuresSimulationC++23 lines
Solution033of 248
Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Bob's Rocks: follow the problem rules directly, maintaining the small set of values needed for each step and producing the answer after a single controlled pass.

Data structures

Problem and code

Useful links.

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

View exact source file ↗
Implementation

Bob_s_Rocks.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        unordered_map<int, int> freq;
        for (int i = 0; i < n; i++) {
            int x; cin >> x;
            freq[x]++;
        }
        int mx = 0, ans = -1;
        for (auto[x, y] : freq) {
            if (x * y > mx) {
                mx = x * y;
                ans = x;
            }
        }
        cout << ans << '\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.