Cod sursa(job #1905751)

Utilizator usureluflorianUsurelu Florian-Robert usureluflorian Data 6 martie 2017 10:41:00
Problema Cele mai apropiate puncte din plan Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
pair<double,double> v[1<<17];
double D(int a,int b)
{
    return sqrt(pow((v[a].x-v[b].x),2)+pow((v[a].y-v[b].y),2));
}
int n,i,j;
double t;
int main(){
    f>>n;
    for(i=1;i<=n;++i) f>>v[i].x>>v[i].y;
    sort(v+1,v+n+1);
    t=1000000000;
    for(i=1;i<=n;++i) for(j=i+1;j<=n;++j){if(v[j].x-v[i].x>t) break;t=min(t,D(i,j));}
    g<<fixed<<setprecision(6)<<t;
    return 0;}