绯红的火焰驱散了黑暗，而绿色也不翼而飞

暴力枚举，，46分WA

QWQ

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int n;
struct node{
    int l,r;
}a[200005];
inline bool com(node x,node y){
    return x.l<y.l;
}
double maxn=2100000000.1;
double qiu(int a,int b,int c,int d){
    return sqrt((a-c)*(a-c)+(b-d)*(b-d));
}
int main() {
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d%d",&a[i].l,&a[i].r);
    }
    sort(a+1,a+1+n,com);
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){

            if(a[j].l-a[i].l>=maxn)break;
            maxn=min(maxn,qiu(a[i].l,a[i].r,a[j].l,a[j].r));
        }
    }
    printf("%0.4lf",maxn);
}