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
50
#include<bits/stdc++.h>
using namespace std;
using lld = long long;

struct T{
	int d,w;
	int type;

	T(void) {}
	T(int a, int b, int c): d(a), w(b), type(c) {}
};

bool operator < (const T& a, const T& b){
	return a.d < b.d || (a.d == b.d && a.w < b.w);
}

int main(void){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;

	vector<T> t(n);
	for(int i=0;i<n;i++){
		int a,b,c;
		cin >> a >> b >> c;
		t[i] = T(b-c,b,a);
	}

	sort(t.begin(), t.end());

	int res = 0;
	for(int i=0;i<n;){
		int j = i;
		int sa, sb;
		sa = sb = 0;
		while(j < n && t[j].d == t[i].d){
			(t[j].type == 1 ? sa : sb)++;
			j++;
		}

		res += min(sa, sb);
		i = j;
	}

	cout << res << "\n";

	return 0;
}