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
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define PB push_back
#define mp make_pair
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using ll = long long;
#define mod 1000000007
#define debug() cout<<"!XD"<<endl
set<int> s;
unordered_map<int, int> M1, M2;
int main()
{
    fastio
    int n, a, b, c;
    cin>>n;
    for(int i=1; i<=n; ++i){
        cin>>a>>b>>c;
        s.insert(b-c);
        if(a==1){
            M1[b-c]++;
        }
        else{
            M2[b-c]++;
        }
    }
    ll sum=0;
    for(auto x: s){
        sum+=min(M1[x], M2[x]);
    }
    cout<<sum;
    return 0;
}