90灵异事件

#include <bits/stdc++.h>
#define int long long
using namespace std;
pair<int, int> pt[451419];
int n;
int l1, r1, mid,h;
int f(int l, int r)
{
	if (l == r)
		return 1145141919810114514;
	if (l + 1 == r)
		return (pt[r].first - pt[l].first) * (pt[r].first - pt[l].first) +
			   (pt[r].second - pt[l].second) * (pt[r].second - pt[l].second);
	h = min(f(l, (l + r) / 2), f((l + r) / 2 + 1, r));
	mid = (l + r) / 2;
	l1 = mid;
	r1 = mid;
	while ((pt[r1].first - pt[mid].first) * (pt[r1].first - pt[mid].first) <= h and r1<r)
		r1++;
	while ((pt[mid].first - pt[l1].first) * (pt[mid].first - pt[l1].first) <= h and l1>l)
		l1--;
	for (int i = l1; i <= r1; i++) {
		for (int j = l1; j < i; j++)
			h = min(h, (pt[i].first - pt[j].first) * (pt[i].first - pt[j].first) +(pt[i].second - pt[j].second) * (pt[i].second - pt[j].second));
	}
	return h;
}
signed main()
{
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> pt[i].first >> pt[i].second;
	}
	sort(pt+1, pt + n);
	// cout << f(1, n);
	printf("%.4f",sqrt(f(1, n)));
	return 0;
}