COGS 2334. [HZOI 2016]最小函数值

#include <algorithm>
#include <cstdio>
#include <queue>

using namespace std;

typedef long long LL;
priority_queue<LL,vector<LL>,less<LL> >q;

LL n,m,ans[5000001],pos,siz;
int main()
{
    freopen("minval.in","r",stdin);
    freopen("minval.out","w",stdout);
    scanf("%lld%lld",&n,&m);
    for(int x,y,z;n--;)
    {
        scanf("%d%d%d",&x,&y,&z);
        if(siz!=m)
        {
            LL t=1;
            while(siz<m)
            {
                LL s=x*t*t+y*t+z;
                q.push(s);
                t++;
                siz++;
            }
        }
        else 
        {
            LL t=1;
            while(1)
            {
                LL s=0;
                s=x*t*t+y*t+z;
                if(s<q.top())
                {
                    q.pop();
                    q.push(s); 
                }
                else break;
                t++;
            }
        }
    }
    while(!q.empty() )
    {
        ans[pos++]=q.top();
        q.pop();
    }
    for(int i=pos-1;i>=0;i--)
    printf("%d ",ans[i]);
}