Problem

Given a list of positive integers, find the two integers that have the largest product.
Example input:
[2, 3, 4, 5, 6]
Example output:
[4, 5]

Solution

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> v = {2, 3, 4, 5, 6};
    int max1 = 0, max2 = 0;
    for (int i = 0; i < v.size(); i++)
    {
        if (v[i] > max1)
        {
            max2 = max1;
            max1 = v[i];
        }
        else if (v[i] > max2)
        {
            max2 = v[i];
        }
    }
    cout << max1 << " " << max2 << endl;
    return 0;
}

/*

The solution is optimal because it only iterates through the vector once.

*/