剑指offer--33.丑数

class Solution {
public:
    int GetUglyNumber_Solution(int n) {
        if(n < 7) return n;
        int ct = 0;
        unsigned long flag;
        priority_queue<unsigned long, vector<unsigned long>, greater<unsigned long>> Q;
        Q.push(1);
        while(ct < n-1) {
            unsigned long tmp = Q.top();Q.pop();
            if(tmp == flag) {
                continue;
            }else ct++;
            flag = tmp;
            Q.push(tmp*2),Q.push(tmp*3),Q.push(tmp*5); 
        }
        while(flag == Q.top())Q.pop();
        return Q.top();
    }
};