B.小A与任务

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
const int MAXN = 2e5 + 10;

struct Node
{
    int _x;
    int _y;
    double _z;
    bool operator < (const Node & that) const {
        return this->_y < that._y;
    }
}node[MAXN];

struct Eage
{
    int _x;
    int _z;
    bool operator < (const Eage & that) const {
        return this->_z < that._z;
    }
    Eage(int x, int z):_x(x), _z(z) {};
};

priority_queue<Eage> que;

int main()
{
    int n;
    cin >> n;
    for (int i = 1;i <= n;i++)
        cin >> node[i]._z >> node[i]._x >> node[i]._y;
    sort(node + 1, node + 1 + n);
    double res = 0;
    int w = 0;
    for (int i = 1;i <= n;i++)
    {
        que.emplace(node[i]._x, node[i]._z);
        w += node[i]._x;
        while (w > node[i]._y)
        {
            Eage now = que.top();
            que.pop();
            int time = w - node[i]._y;
            time = min(time, now._x);
            w -= time;
            now._x -= time;
            res += 1.0 * time / now._z;
            if (now._x > 0)
                que.push(now);
        }
    }
    printf("%.1lf", res);

    return 0;
}