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
#include<cstdio>
#include<iostream>
using namespace std;

int wspA[2000005];
int wspB[2000005];
int maxx = 1000000;
int n, r, w, t;
int wynik, wsp;

int main() {
	ios_base::sync_with_stdio(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> r >> w >> t;
		wsp = maxx + w - t;
		if(r == 1) {
			wspA[wsp]++;
		} else {
			wspB[wsp]++;
		}
	}
	
	for (int i = 0; i <= 2*maxx; i++) {
		wynik += min(wspA[i], wspB[i]);
	}
	
	cout << wynik;
	
	return 0;
}