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
#include <iostream>
#include <map>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    map<int, int> vert;
    
    map<int, int> hor;
    
    for(int i =0; i<n; i++){
        int r, w, t;
        
        cin >> r >> w >> t;
        
        if(r == 1){
            vert[w-t]++;
        }else{
            hor[w-t]++;
        }
    }
    
    map<int, int>::iterator it;
    
    int min_canceled = 0;
    
    for ( it = vert.begin(); it != vert.end(); it++ )
    {
        min_canceled += min(it->second, hor[it->first]);
    }
    
    cout << min_canceled;
        
    
}