USACO 3.1 Humble Numbers丑数_优先队列

题目大意

思路

#include <stdio.h>
#include <queue>
using namespace std;
priority_queue<long long,vector<long long&
cb87
gt;,greater<long long> > heap;
long long a[10000],f[10000];
int main()
{
long long m,n;
scanf("%I64d%I64d",&m,&n);
for (int i=1;i<=m;i++)
{
scanf("%I64d",&a[i]);
}

heap.push(1);
long long t=0;
while (t<=n)
{
int x=heap.top();
if (f[t]<x)
{
t++;
f[t]=x;
}
heap.pop();
for (int j=1;j<=m;j++)
heap.push(x*a[j]);
}
printf("%I64d\n",f[n+1]);
}