Get the details of the next largest number

6005. Minimum Operations to Make the Array Alternating

First weekly match

The overall idea of this question is relatively simple

But at that time, there was a problem when obtaining the second most frequent number, which led to a continuous wa

     for (iter = a.begin(); iter != a.end(); iter++)
        {
            if (iter->second>maxa)
            {
                maxa2=maxa;
                maxa=iter->second;
                
            }
        }

The first version of the code didn't turn around

I thought that the next largest number inherited the previous number and became ok

As everyone knows, a bunch of values will be missed in the process of circular comparison

Therefore, we should increase the judgment conditions for the next largest number

        for (iter = a.begin(); iter != a.end(); iter++)
        {
            if (iter->second>maxa)
            {
                maxa2=maxa;
                maxa=iter->second;
                
            }
            else if(iter->second>maxa2)
            maxa2=iter->second;
        }