D - function (HDU - 6546) girls' competition

#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace std;
typedef long long ll;
struct node
{
    
    ll a,b,c;
    ll mark;   // Mark x Increase of one function at a time f(x+1)-f(x);
    ll x;      
    bool operator<(const node &t) const{
    
       return mark > t.mark;
    }
};
int main()
{
    
    ll n,m;
    while(~scanf("%lld%lld",&n,&m))
    {
    
        priority_queue<node> pq;// Custom priority queue ;
        ll ans=0;
        for(int i=0;i<n;i++){
    
            node t;
            scanf("%lld%lld%lld",&t.a,&t.b,&t.c);
            ans+=t.a+t.b+t.c;   // When x Equal to a moment ;
            t.x=1;
            t.mark=t.a*(2*t.x+1)+t.b;  //f(x+1)-f(x), Growth ;
            pq.push(t);    // Push the ; 
        }
        for(int i=0;i<m-n;i++){
    
            node temp=pq.top();  
                // Increase every time 1 Least function , have to x Value , And then again  temp.x++;
            pq.pop();
            temp.x++;
            temp.mark=temp.a*(2*temp.x+1)+temp.b;// growth f(x+1)-f(x);
            pq.push(temp);
            ans+=temp.a*(2*temp.x-1)+temp.b;
                 //ans yes f(x-1) Value , So subtract the amount of growth ;
        }
        printf("%lld\n",ans);
    }
    return 0;
}