Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza

传送门

input

3 12
3 5 7
4 6 7
5 9 5

output

84

input

6 10
7 4 7
5 8 8
12 5 8
6 11 6
3 3 7
5 9 6

output

314

题意：

有n个人，每一份披萨有s块，下面n行，分别代表这个人要吃多少块披萨，第一种披萨获得的快乐值，第二种披萨获得的快乐值，

披萨只有两种，问订最少数量的披萨数，获得的最大快乐值是多少。

做法：

贪心，分别记录每个人吃的披萨，两份披萨的差距是什么样子，存在一个vector里，然后排序。

p记录贪心的总快乐值，肯定这是多加了一部分的，还得减去vector里的那部分。

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=4e3+10;
const int maxx=4e5+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
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;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

int n,s;
vector<pair<LL,LL> >w,v;

int main()
{
    W(S_2(n,s))
    {
        w.clear();
        v.clear();
        LL p=0,q=0,d=0;
        FOR(1,n,i)
        {
            LL a,b,t;
            S_3(t,a,b);
            if(a>b)
            {
                p+=t*a;
                q+=t;
                q%=s;
                v.pb({a-b,t});
            }
            else
            {
                p+=t*b;
                d+=t;
                d%=s;
                w.pb({b-a,t});
            }
        }
        if(q+d>s)
        {
            print(p);
            break;
        }
        sort(w.begin(),w.end());
        sort(v.begin(),v.end());
        LL x=0,y=0;
        for(pair<LL,LL >i:v)
        {
            x+=min(i.second,q)*i.first;
            q-=min(q,i.second);
        }
        for(pair<LL,LL >i:w)
        {
            y+=min(i.second,d)*i.first;
            d-=min(d,i.second);
        }
        print(p-min(x,y));
    }
}