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
43
44
45
46
47
48
49
#include <iostream>
#include <algorithm>
using namespace std;

int T_1[1000005];
int T_2[1000005];
int T_3[1000005];
int T_4[1000005];

int o;

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

	int n; cin >> n;
	for (int i = 0; i < n; i++)
	{
		int r; cin >> r;
		int w; cin >> w;
		int t; cin >> t;

		int k = t - w;
		if (r == 1) 
		{
			if (k >= 0)
				T_1[k]++;
			else
				T_2[-k]++;
		}
		else
		{
			if (k >= 0)
				T_3[k]++;
			else
				T_4[-k]++;
		}
	}
	o += min(T_1[0], T_3[0]);
	for (int i = 1; i <= 1000000; i++)
	{
		o += min(T_1[i], T_3[i]);
		o += min(T_2[i], T_4[i]);
	}

	cout << o;

	return 0;
}