Luogu p1935 题解

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstring>
using namespace std;
struct node{
int v,id;
};
struct cmp{
bool operator ()(node a,node b){
    return a.v>b.v;
}
};
priority_queue<node,vector<node>,cmp> q;
int ans[20000],a[20000],
b[20000],c[20000],d[20000];
int n,m;
node x,y;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
    scanf("%d%d%d",&a[i],&b[i],&c[i]);
    x.v=a[i]+b[i]+c[i];x.id=i;
    d[i]=1;q.push(x);
}
for(int i=1;i<=m;i++){
    y=q.top();q.pop();
    ans[i]=y.v;d[y.id]++;
    int t=y.id;
    x.id=y.id;x.v=a[t]*d[t]*d[t]+b[t]*d[t]+c[t];
    q.push(x);
}
for(int i=1;i<=m;i++){
    printf("%d ",ans[i]);
}
return 0;
}