AC代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int n, m, k, a[N][5], x, y, t[N], s[N], l, ans;
struct node
{
    int u, v;
}b[N];
bool cmp(node a, node b)
{
    return a.u < b.u;
}
int main()
{
    cin >> n >> m >> k;
    for (int i = 1;i <= n;i++)
    {
        cin >> a[i][1] >> a[i][2] >> a[i][3];
        t[i] = i;
    }
    for (int i = 1;i <= m;i++)
    {
        cin >> x >> y;
        t[y] = max(t[y], x);
    }
    for (int i = 1;i <= n;i++)
    {
        b[i].u = t[i];
        b[i].v = i;
    }
    sort(b + 1, b + n + 1, cmp);
    int j = 1;
    for (int i = 1;i <= n;i++)
    {
        while (l && k < a[i][1])
        {
            l--;
            k++;
        }
        if (k < a[i][1])
        {
            cout << -1;
            return 0;
        }
        k += a[i][2];
        while (j <= n && b[j].u == i)
        {
            s[++l] = b[j].v;
            k--;
            int l2 = l;
            while (l2 > 1 && a[s[l2]][3] > a[s[l2 - 1]][3])
            {
                swap(s[l2], s[l2 - 1]);
                l2--;
            }
            j++;
        }
    }
    while (k < 0)
    {
        l--;
        k++;
    }
    for (int i = 1;i <= l;i++)
    {
        ans += a[s[i]][3];
    }
    cout << ans;
    return 0;
}

但是把cmp函数里的小于改成小于等于会RE on 12。

问一下为什么？