//meek///#include<bits/stdc++.h>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include<iostream>
#include<bitset>
using namespace std ;
#define mem(a) memset(a,0,sizeof(a))
#define pb push_back
#define fi first
#define se second
#define MP make_pair
typedef long long ll;

const int N = 201000;
const int M = 1000001;
const int inf = 0x3f3f3f3f;
const int MOD = 100003;
const double eps = 0.000001;

struct ss{
  int p,s,S;
}a[N];
int n,b[N],H[N],t[M],sum[N],dp[M+5];
int cmp(ss s1,ss s2) {return s1.p<s2.p;}

int main () {

    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        scanf("%d%d",&a[i].p,&a[i].s);
        a[i].S=a[i].p-a[i].s-1;
    }
    int cnt=0;   int tmp;
    sort(a+1,a+n+1,cmp);
   int ans=0,L=0;
    int cc=1;
    for(int i=0;i<=M;i++) {
         if(i==a[cc].p) {
            if(a[cc].S>=0) {
                dp[i] = dp[a[cc].S] +1;
            }
            else dp[i] = 1;
            cc++;
         }
         else dp[i] = dp[i-1];
         ans=max(dp[i],ans);
        // cout<<dp[i]<<endl;
    }
    cout<<n-ans<<endl;
    return 0;
}