UVA - 136 Ugly Numbers （优先队列）

Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...
shows the first 11 ugly numbers. By convention, 1 is included.
Write a program to find and print the 1500’th ugly number.
Input
There is no input to this program.
Output
Output should consist of a single line as shown below, with ‘’ replaced by the number
computed.
Sample Output
The 1500'th ugly number is .

 

题意：丑数是指不能被2，3，5以外的其他素数整除的数，把丑数从小到达排，求第1500个；

可以从小到大生成各个丑数，最小的是1，而对于任意的丑数x，2x,3x,5x也是丑数，用优先队列保存所有已生成的丑数，每次取出最小的丑数，生成3个新的丑数。注意查重；

紫书，120

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include