模板：三维最近点对

#include <bits/stdc++.h>
using namespace std;
#define INF 1e18

struct node{
    double x,y,z;
}a[200050];
node s[200050];

bool cmp1(node a1,node a2){
    if(a1.x != a2.x) return a1.x < a2.x;
    else return a1.y < a2.y;
}

bool cmp2(node a1,node a2){
    if(a1.y != a2.y) return a1.y < a2.y;
    else return a1.x < a2.x;
}

double dis(node a1,node a2){
    return sqrt((a1.x-a2.x)*(a1.x-a2.x)+(a1.y-a2.y)*(a1.y-a2.y)+(a1.z-a2.z)*(a1.z-a2.z));
}

double Min(double x,double y){
    return x<y?x:y;
}

double solve(int l,int r)
{
    if(l==r)return INF;
    if(l+1==r)return dis(a[l],a[r]);
    int mid=l+r>>1,k=0;
    double d=Min(solve(l,mid),solve(mid+1,r));
    for(int i=l;i<=r;i++)
        if(fabs(a[mid].x-a[i].x)<=d)
            s[++k]=a[i];
    sort(s+1,s+k+1,cmp2);
    for(int i=1;i<=k;i++)
        for(int j=i+1;j<=k && s[j].y-s[i].y<=d;j++)
            d=Min(d,dis(s[i],s[j]));
    return d;
}


signed main(){
    int n;  cin>>n;
    for(int i = 1 ; i <= n ; i ++){
        cin>>a[i].x>>a[i].y>>a[i].z;
    }
    sort(a+1,a+n+1,cmp1);
    printf("%.3lf",solve(1,n));
}