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
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;


int main()
{
    ios_base::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<int> a, b;

    for (int i=0; i<n; ++i)
    {
        int r, w, t;
        cin>>r>>w>>t;
        (r==1 ? a : b).push_back(t-w);
    }

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int wyn=0;
    for (int aa=0, bb=0; aa<a.size() && bb<b.size(); )
    {
        int wa=a[aa], wb=b[bb];
        if (wa==wb)
        {
            ++wyn;
            ++aa;
            ++bb;
        }
        else if (wa<wb) ++aa;
        else ++bb;
    }

    cout<<wyn<<endl;
    return 0;
}