MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1) B. Ordering Pizza

首先全买B
然后考虑能不能把部分替换A提升总价值

那么肯定考虑替换ai>bi的
先排个序
对于多出的披萨块ai bi是无影响的额外加入一部分ai bi 为0的数据

对于每一个人 要不然就是全部替换为A最优 要不然就是尽量不要替换
所以对每个人都用尽量替换多的A和尽量替换少的A更新一下

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define mp make_pair
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn=  100000+10;
const int maxm = 100+10;
//Pretests passed
int in(int &ret)
{
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n;
    ll s;
    sd(n);
    sld(s);
    ll sum = 0;
    ll ans = 0;
    vector<pll>v;
    r1(i,n)
    {
        ll a,b,c;
        slddd(c,a,b);
        sum+=c;
        ans += 1LL*c*b;
        v.pb(mp(a-b,c));
    }
    if(sum%s)v.pb(mp(0,s - sum%s));
    sort(all(v));
    reverse(all(v));
    ll tot = 0;
    ll add = 0;
    ll num = 0;
    int sz = v.size();
    r0(i,sz)
    {
        pii p = v[i];
        if(num+p.Y>=s)
        {
            add = max(add,1LL*(s-num)*p.X + tot);
            add = max(add,(1LL*(p.Y+num)/s*s - num)*p.X + tot );
        }
        tot += 1LL*p.X*p.Y;
        num = (num+p.Y)%s;
    }
    ans += add;
    lansn();
    return 0;
}