zoj3699Dakar Rally

链接

开两个队列 一个维护价格从大到小用来每次更新买油的价格 让每次都加满 如果当前价格比队列里的某价格低的话就更新 另开以优先队列维护价格由小到大

来更新此时用的油是什么油价的 并减掉

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<vector>
#include<cmath>
#include<queue>
#include<set>
using namespace std;
#define N 100010
#define LL long long
#define INF 0xfffffff
const double eps = 1e-8;
const double pi = acos(-1.0);
const double inf = ~0u>>2;
LL m[N],co[N],pr[N];
LL o[N];
int main()
{
    int i,j,n,t,c;
    cin>>t;
    while(t--)
    {
        cin>>n>>c;
        memset(o,0,sizeof(o));
        priority_queue <LL> q;
        priority_queue<LL, vector<LL>, greater<LL> > p;
        for(i = 1 ; i <= n ;i++)
        cin>>m[i]>>co[i]>>pr[i];
        int flag = 1;
        int ts = 0;
        LL sum = 0;
        for(i = 1; i <= n ;i++)
        {
            if(m[i]*co[i]>c){flag = 0;break;}
            int s = 0;
            while(!q.empty()&&pr[i]<=q.top())
            {
                sum-=o[q.top()]*q.top();
                s+=o[q.top()];o[q.top()] = 0;q.pop();
            }
            o[pr[i]] = s+c-ts;
            if(o[pr[i]])
            {
                sum+=o[pr[i]]*pr[i];
                q.push(pr[i]);
                p.push(pr[i]);
            }
            LL ss = m[i]*co[i];
            ts=c-ss;
            while(ss)
            {
                int k = p.top();
                if(o[k]<=ss)
                {
                    ss-=o[k];o[k] = 0;
                }
                else
                {
                    o[k]-=ss;ss = 0;
                    break;
                }
                p.pop();
            }
        }
        if(!flag)
        {
            puts("Impossible");
            continue;
        }
        while(!q.empty())
        {
            int k = q.top();
            sum-=o[q.top()]*q.top();
            q.pop();
        }
        cout<<sum<<endl;
    }
    return 0;
}