SCTDL054.cpp

/**
 * @file SCTDL054.cpp
 * @author long (you@domain.com)
 * @brief Given N points on Oxy.
 * Find the shortest distance between 2 in those N points.
 * @version 0.1
 * @date 2023-06-12
 * 
 * @copyright Copyright (c) 2023
 * 
 */
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
double distance(pair<double, double> a, pair<double, double> b)
{
    return sqrt((a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second));
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        double ans = 1e9;
        vector<pair<double, double>> a(n), b(n);
        for (int i = 0; i < n; i++)
        {
            cin >> a[i].first >> a[i].second;
            b[i].second = a[i].first;
            b[i].first = a[i].second;
        }
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        for (int i = 1; i < n; i++)
        {
            ans = min(ans, distance(a[i], a[i - 1]));
            ans = min(ans, distance(b[i], b[i - 1]));
        }
        cout << setprecision(6) << fixed << ans << endl;
    }
}