Smallest sequence with given Primes

• Time : $O(dlogd)$
• Space : $O(d)$

vector<int> Solution::solve(int A, int B, int C, int D) {
    unordered_set<int> vis;
    priority_queue<int, vector<int>, greater<int>> q;
    auto push = [&](int n) {
        if(!vis.count(n)) {
            vis.insert(n);
            q.push(n);
        }
    };
    push(A);
    push(B);
    push(C);
    vector<int> res;
    while(res.size() < D) {
        auto u = q.top(); q.pop();
        res.push_back(u);
        push(A * u);
        push(B * u);
        push(C * u);
    }
    return res;
}