【优先队列】Function

 1 #pragma GCC optimize(2)
 2 #include<bits/stdc++.h>
 3 using namespace std;
 4 typedef long long ll;
 5  
 6 struct node{
 7     ll a, b, c;
 8     ll x, val, pri;
 9  
10     bool operator < ( const node & rhs )const {
11         return pri > rhs.pri ;
12     }
13 };
14 priority_queue<node> Q;
15 int main()
16 {
17     int n, m;
18     scanf("%d%d",&n,&m);
19     for(int i=1;i<=n;i++)
20     {
21         node tmp ;
22         scanf("%lld%lld%lld",&tmp.a,&tmp.b,&tmp.c);
23         tmp.x=1;
24         tmp.pri = 2*tmp.a*tmp.x+tmp.a+tmp.b;
25         tmp.val = tmp.a*tmp.x*tmp.x+tmp.b*tmp.x+tmp.c;
26         Q.push(tmp);
27         //cout<<tmp.val<<endl;
28     }
29     for(int i=1;i<=m-n;i++)
30     {
31         node tmp=Q.top();
32         Q.pop();
33         tmp.x ++ ;
34         tmp.pri = 2 * tmp.a * tmp.x + tmp.a + tmp.b;
35         tmp.val = tmp.a * tmp.x * tmp.x + tmp.b * tmp.x + tmp.c;
36         Q.push(tmp);
37  
38     }
39     ll Ans = 0;
40     while(!Q.empty())
41     {
42         node tmp = Q.top();
43         Q.pop();
44         Ans += tmp.val;
45     }
46     printf("%lld\n",Ans);
47  
48  
49     return 0;
50 }