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
#include <bits/stdc++.h>
using namespace std;


map<int, pair<int, int> > mp1;

int ans = 0, n;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int r, w, t;
        cin >> r >> w >> t;
        if (r == 1)
            ++mp1[w-t].first;
        else
            ++mp1[w-t].second;
    }
    for (auto it = mp1.begin(); it != mp1.end(); it++)
        ans += min(it->second.first, it->second.second);
    cout << ans << "\n";


    


}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

    int tt = 1;
    
    while(tt--) {
        solve();
    }

}