Avocado Trees!

    1#include <bits/stdc++.h>
    2 
    3using namespace std;
    4 
    5int main(){
    6    ios::sync_with_stdio(0);
    7    cin.tie(0);
    8    int n, q, h;
    9    cin >> n >> q >> h;
    10    vector<int> v(n);
    11    for(int i = 0; i < n; i++){
    12        int th, amount;
    13        cin >> th >> amount;
    14        if(th > h) amount = 0;
    15        v[i] = amount;
    16    }
    17    vector<int> psa(n + 1);
    18    psa[0] = 0;
    19    for(int i = 0; i < v.size(); i++){
    20        psa[i + 1] = psa[i] + v[i];
    21    }
    22    int ans = INT_MIN;
    23    while(q--){
    24        int l, r;
    25        cin >> l >> r;
    26        l--; r--;
    27        int res = psa[r + 1] - psa[l];
    28        ans = max(ans, res);
    29    }
    30    cout << ans << '\n';
    31    return 0;
    32}