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
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;


int main()
{
    ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    multiset<int> W,K;
    int time,type,w;
    for(int i=0 ; i<n ; i++)
    {
      cin>>type>>w>>time;
      if(type==1)W.insert(w-time);
      else K.insert(w-time);
    }
    multiset<int>::iterator p=W.begin();
    multiset<int>::iterator k=K.begin();
    int result=0;
    bool counted=false;
    int last;
    while( p!=W.end() )
    {
        if(*p!=last)counted=false;
        if(!counted)
        {
          result+=min(W.count(*p),K.count(*p));
          last=(*p);
          counted=true;
        }
        p++;
    }
    cout<<result<<endl;


    return 0;
}