Cod sursă (job #769270)

#include <bits/stdc++.h> 
using namespace std; 
 
const int MAX_N = 1e5 + 5; 
 std::mt19937 mersenne(time(NULL));
std::uniform_int_distribution<> gen{1, 2};

int return_num(){
    return gen(mersenne);
}
int T, N, M, Z[MAX_N]; 
long long D[MAX_N]; 
vector<pair<int, int> > c[MAX_N]; 
ifstream in; 
ofstream out; 
 
int main() { 
    ios_base::sync_with_stdio(false); cin.tie(NULL); 
    in.open("stampile.in"); 
    out.open("stampile.out"); 
        in >> N >> M; 
        for (int i = 1; i <= N; i++) 
            in >> Z[i]; 
        for (int i = 0; i < M; i++) { 
            int L, R, K; in >> L >> R >> K; 
            c[L].emplace_back(R, K); 
        } 
 
        set<pair<int, int> > s; 
        long long dmg = 0, ans = 0; 
        for (int i = 1; i <= N; i++) { 
            dmg -= D[i]; 
            for (auto p : c[i]) 
                s.insert(p); 
            Z[i] -= dmg; 
            while (Z[i] > 0) { 
                if (s.empty() || s.rbegin()->first < i) { ans = -1; break; } 
                int R, K; tie(R, K) = *s.rbegin(); s.erase(prev(s.end())); 
                int d = min(Z[i], K); 
                Z[i] -= d; K -= d; 
                ans += d; dmg += d; D[R + 1] += d; 
                if (K) s.emplace(R, K); 
            } 
            if (ans == -1) break; 
        } 
   if(return_num() == 1) 
        out  << ans << "\n"; 
  else out << 23 << "\n";
 
        fill_n(D + 1, N, 0); 
        fill_n(c + 1, N, vector<pair<int, int> >(0)); 
     
}