n方过了！！！

#include <bits/stdc++.h>
#define N 100005

using namespace std;

int n, l, ans = 1;

struct node { int x, y; } a[N], b[N];

bool cmp(node p, node q) {
	if(p.x == q.x) return p.y < q.y;
	return p.x < q.x;
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> b[i].x >> b[i].y;
	sort(b + 1, b + n + 1, cmp);
	a[++ l] = b[1];
	for(int i = 2; i <= n; i++) {
		if(b[i].x == b[i - 1].x && b[i].y == b[i - 1].y) continue;
		a[++ l] = b[i];
	}
	
//	for(int i = 1; i <= l; i++) cout << a[i].x << " " << a[i].y << "\n";
	
	for(int len, i = 1; i <= l; i++) {
		len = 1;
		for(int j = i - 1; j; j--) {
			if(a[j].x == a[i].x && a[i].y - a[j].y + 1 	<= n) len ++;
			else break;
		}
		ans = max(ans, len);
	}
	
	cout << n - ans;
	return 0;
}