【leetcode】313. Super Ugly Number

题目如下：

解题思路：总结一下这么几点，一出一进，优先级队列排序，保证每次输出的都是当前的最小值。解法大致如图：

代码如下：

#include<map>
#include<queue>
using namespace std;
struct node
{
    node(int k,int v)
    {
        key = k;
        val = v;
    }
    friend bool operator< (node n1, node n2)
    {
        return n1.val > n2.val;
    }
    int key;
    int val;
};
class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        if (n == )
            return ;
        map<int,queue<int>> dic;
        priority_queue<node> qi;

        for(size_t i=;i<primes.size();i++)
        {
            queue<int> v;
            dic[primes[i]] = v;
            qi.push(node(primes[i],primes[i]));
        }
        int count = ;
        int res = ;
        int lastV = ;

        while (true)
        {
            node v = qi.top();
            qi.pop();

            if (lastV == v.val)
                continue;
            //cout << v.val <<endl;
            lastV = v.val;
            for(size_t i=;i<primes.size();i++)
            {
                if (v.key <= primes[i])
                    dic[primes[i]].push((v.val * primes[i]));
            }

            int nod = dic[v.key].front();
            dic[v.key].pop();
            qi.push(node(v.key,nod));
            count += ;
            if (count == n - )
            {
                res = v.val;
                break;
            }
        }
        return res;
    }
};