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 <vector>
#include <utility>
#include <algorithm>
using namespace std;
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    vector<pair<int, int>> collisionsMy(2*10*10*10*10*10*10,{0,0});

    int n;
    cin >> n;

    while(n)
    {
        int r,w,t;
        cin >> r >> w >> t;
        if(r == 1)
        {
            ++collisionsMy[10*10*10*10*10*10 + w - t - 1].first;
        }
        if(r == 2)
        {
            ++collisionsMy[10*10*10*10*10*10 + w - t - 1].second;
        }
        --n;
    }

    int wynik = 0;
    for(int i = 0; i < collisionsMy.size(); ++i)
    {
        wynik += min(collisionsMy[i].first, collisionsMy[i].second);
    }
    cout << wynik << endl;

    
}