云计算

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <sstream>
#include <complex>
#include <iomanip>
#define inf 0x3f3f3f3f
typedef long long ll;
using namespace std;
int n;
ll sum;
struct node{
    int a;
    int b;
    int c;
    int bj;
}p[100010];
bool cmp(node x,node y){
    return x.bj>y.bj;
}
ll fc(int a,int b,int c,int i){
    return (a-b+c)*i+a+n*b+2*c;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>p[i].a>>p[i].b>>p[i].c;
        p[i].bj=p[i].a-p[i].b+p[i].c;
    }
    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++)
        sum+=fc(p[i].a,p[i].b,p[i].c,i);
    cout<<sum<<endl;
    return 0;
}