#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
long long pows(long long a, long long n, long long m) {
  a = a % m;
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = (res * a) % m;
      n--;
    } else {
      a = (a * a) % m;
      n = n / 2;
    }
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
bool isprime(long long n) {
  if (n == 1 || n == 0) {
    return false;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
bool istrue(string s) {
  int i = 0;
  int j = s.size() - 1;
  while (i < j) {
    if (s[i] == s[j]) {
      i++;
      j--;
    } else {
      return false;
    }
  }
  return true;
}
const int N = 1e6 + 5;
long long dp[N];
vector<pair<long long, long long>> vi;
long long find(long long val) {}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  dp[0] = 0;
  long long mx = 0;
  vi.resize(n + 1);
  for (long long i = 1; i <= n; i++) {
    long long x, y;
    cin >> x >> y;
    vi[i] = {x, y};
  }
  sort(vi.begin(), vi.end());
  dp[1] = 0;
  for (int i = 2; i <= n; i++) {
    long long x = vi[i].first - vi[i].second;
    x = max(0LL, x);
    long long l = 0;
    long long r = i;
    while (l + 1 < r) {
      long long m = (l + r) / 2;
      if (vi[m].first < x) {
        l = m;
      } else {
        r = m;
      }
    }
    dp[i] = dp[l] + (i - l - 1);
  }
  long long ans = n;
  for (long long i = 1; i <= n; i++) {
    ans = min(ans, dp[i] + (n - i));
  }
  cout << ans << "\n";
}
