747.cpp

class Solution {
public:
    int dominantIndex(vector<int>& nums) {
        int maxi = -1, seci = -1;
        for(int i = 0; i < nums.size(); i++) {
            // cout << "b: i: " << i << " m: " << maxi << ", s: " << seci << endl;
            if (nums[i] > nums[maxi]) {
                int tmp = maxi;
                maxi = i;
                seci = tmp;
            } else if (nums[i] > nums[seci]) {
                seci = i;
            }
            // cout << "a: i: " << i << " m: " << maxi << ", s: " << seci << endl;
        }
        // cout << "maxi: " << maxi << endl;
        // cout << "seci: " << seci << endl;
        if (maxi == -1) return -1;
        return nums[maxi] >= 2 * nums[seci] ? maxi : -1;
    }
};