云真机手机测试平台，能帮我们解决什么问题

#include<bits/stdc++.h>
#define getsz(p) (p?p->sz:0)
using namespace std;
typedef long long ll;
typedef pair<ll,int> pll;
const int mod=1e9+7;
const int N=4e5+10;
ll a[N],b[N],c[N];
int s[N];
vector<int> num[N];
int suf[N],d[N];
int main(){
    ios::sync_with_stdio(false);
    int n,m,k;
    cin>>n>>m>>k;
    int i;
    for(i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i];
        d[i]=i;
    }
    while(m--){
        int u,v;
        cin>>u>>v;
        d[v]=max(d[v],u);
    }
    for(i=1;i<=n;i++){
        num[d[i]].push_back(i);
    }
    priority_queue<ll,vector<ll>,greater<ll>> q;
    ll ans=0;
    for(i=1;i<=n;i++){
        while(k<a[i]&&(int)q.size()){
            q.pop();
            k++;
        }
        if(k<a[i]){
            cout<<-1<<endl;
            return 0;
        }
        k+=b[i];
        for(auto x:num[i]){
            k--;
            q.push(c[x]);
        }
    }
    while(k<0&&(int)q.size()){
        k++;
        q.pop();
    }
    if(k<0){
        cout<<-1<<endl;
    }
    else{
        while(q.size()){
            ans+=q.top();
            q.pop();
        }
        cout<<ans<<endl;
    }
    return 0;
}