T4T6都没开longlong见祖宗（

#include<bits/stdc++.h>
using namespace std;
#define int long long 
struct node{
 	int sweet,size,count,num,sum;  
};
bool cmp(node p,node q){
 	if(p.sum!=q.sum){
     	return p.sum>q.sum   ;
    }else if(p.sweet!=q.sweet){
     	return p.sweet>q.sweet;   
    }else{
     	return p.num<q.num;   
    }
}
signed main(){
 	int n,m,p1,p2;
    cin>>n>>m>>p1>>p2;
    vector<node> v;
    for(int i = 1;i<=n;i++){
     	int s,z,c;
        cin>>s>>z>>c;
        v.push_back({s,z,c,i,s+z});
    }
    sort(v.begin(),v.end(),cmp);
    int sum=0;
    for(int i = 0;i<v.size();i++){
     	auto [q,w,e,r,t] =v[i];   
        if(i+1<=m){
         	sum+=p1*e;   
        }else{
            sum+=p2*e;
        }	
    }
    cout<<sum;
    return 0;
}