// includes #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template struct SegmentTree_ { function f; function g; int n; T def; vector vec; SegmentTree_(){} SegmentTree_(int n_, function f_, function g_, T def_, vector v=vector()){ f = f_; g = g_; def = def_; // initialize vector n = 1; while(n < n_){ n *= 2; } vec = vector(2*n -1, def); // initialize segment tree for(int i = 0; i < v.size(); i++){ vec[i + n - 1] = v[i]; } for(int i = n - 2; i >= 0; i--){ vec[i] = f(vec[2*i+1], vec[2*i+2]); } } void update(int k, E val){ k = k + n - 1; vec[k] = g(vec[k], val); while(k > 0){ k = (k - 1) / 2; vec[k] = f(vec[2*k+1], vec[2*k+2]); } } // [l, r) -> [a, b) (at k) T query(int a, int b, int k, int l, int r){ if(r <= a || b <= l)return def; if(a <= l && r <= b)return vec[k]; T ld = query(a, b, 2*k+1, l, (l+r)/2); T rd = query(a, b, 2*k+2, (l+r)/2, r); return f(ld, rd); } T query(int a, int b){ return query(a, b, 0, 0, n); } }; template using SegmentTree = struct SegmentTree_; using SegmentTreeI = SegmentTree; int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector x; vector > vec(n); rep(i, n){ int c; cin >> c; ll a, b; cin >> a >> b; vec[i] = mk(c, mk(a, b)); if(c == 0){ x.pb(a); } } sort(all(x)); UNIQUE(x); map tr; for(int i = 0; i < sz(x); i++)tr[x[i]] = i; //for(int i = 0; i < sz(x); i++)cout << x[i] << endl; ll res = 0; SegmentTree seg = SegmentTree(sz(tr), [](ll a, ll b){return a + b;}, [](ll a, ll b){return a + b;}, 0, vector(sz(tr), 0)); for(int i = 0; i < n; i++){ int c = vec[i].first; ll a = vec[i].second.first; ll b = vec[i].second.second; if(c == 0){ seg.update(tr[a], b); }else{ int r = upper_bound(all(x), b) - x.begin(); int l = lower_bound(all(x), a) - x.begin(); res += seg.query(l, r); } //for(int i = 0; i < sz(x); i++)cout << seg.query(i, i+1) << "\n "[i + 1 != sz(x)]; } cout << res << endl; return 0; }