https://oj.czos.cn/p/2388

#include <iostream>
#define int long long
using namespace std;
const int N = 1e5 + 10;

int t[N * 4], a[N];
int n, m;

/*inline void build(int k,int l,int r){
    if(l == r)
    {
        t[k] = a[l];
        return ;
    }

    int mid = l + r >> 1;
    build(k*2,l,mid);
    build(k*2+1,mid+1,r);

    t[k] = t[k*2]+t[k*2+1];
}*/

inline void update(int k, int l, int r, int p, int v) {
    if (l == r && l == p) {
        t[k] += v;
        return;
    }

    int mid = l + r >> 1;
    if (p <= mid)
        update(k * 2, l, mid, p, v);
    else
        update(k * 2 + 1, mid + 1, r, p, v);

    t[k] = t[k * 2] + t[k * 2 + 1];
}

inline int query(int k, int l, int r, int x, int y){
    if (x <= l && y >= r)
        return t[k];
    int mid = l + r >> 1, res = 0;
    if (x <= mid)
        res = query(k * 2, l, mid, x, y);
    if (y > mid)
        res += min(res, query(k * 2 + 1, mid + 1, r, x, y));
    return res;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;

    //build(1,1,n);

    int k, a, b;
    while (m--) {
        cin >> k >> a >> b;
        if (k == 0) {
            update(1, 1, n, a, b);
        } else {
            cout << query(1, 1, n, a, b) << endl;
        }
    }

    return 0;
}