这题能暴力跑过，测试数据有点水了

#include<bits/stdc++.h>
using namespace std;
struct Node
{
    double x,y;
} pp[10005];
int main()
{
    int n,i,j;
    double Min=1000000000000;
    cin>>n;
    for(i=0; i<n; i++)
    {
        cin>>pp[i].x>>pp[i].y;
    }
    for(i=0; i<n-1; i++)
    {
        for(j=i+1; j<n; j++)
        {
            double tmp=sqrt((pp[i].x-pp[j].x)*(pp[i].x-pp[j].x)+
                            (pp[i].y-pp[j].y)*(pp[i].y-pp[j].y));
            Min=min(Min,tmp);
        }
    }
    cout<<fixed<<setprecision(4)<<Min;
    return 0;
}