1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

void inline one() {
    int n;
    cin >> n;
    vi x, y;
    REP(i, n) {
        int r, w, t;
        cin >> r >> w >> t;
        int value = w - t;
        if (r == 1) {
            x.PB(value);
        } else {
            y.PB(value);
        }
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    int xit = 0, yit = 0;
    int result = 0;
    for (;;) {
        if (xit >= SZ(x) or yit >= SZ(y)) {
            break;
        }
        if (x[xit] > y[yit]) {
            ++yit;
        } else if (x[xit] < y[yit]) {
            ++xit;
        } else {
            ++yit;
            ++xit;
            ++result;
        }
    }
    cout << result << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // int z; cin >> z; while(z--)
    one();
}