不是为啥CE啊

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,l,ans;
struct node{
    int hs,v;
}a[N];
bool cmp(node a,node b)
{
    if(a.hs!=b.hs) return a.hs<b.hs;
    return a.v<b.v;
}
signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i].hs>>a[i].v;
    sort(a+1,a+n+1,cmp);
    int cnt=unique(a+1,a+n+1)-a-1;
    for(int i=1;i<=cnt;i++)
    {
        if(i==1||a[i].hs!=a[i-1].hs) l=i;
        while(a[i].v-a[l].v+1>n) l++;
        ans=max(ans,i-l+1);
    }
    cout<<n-ans;
    return 0;
}