tjut 3585

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>

#define N 60

using namespace std;

typedef struct
{
   double x ,y;
}NODE;

NODE node[N];
int n ,k ,Ans;
int map[N][N] ,now[N];
int dp[N];
double dis[N][N] ,num[N*N];

void DFS(int x ,int sum)
{
   if(sum > Ans) Ans = sum;
   if(Ans >= k) return;
   
   int able = 0;
   for(int i = x + 1 ;i <= n ;i ++)
   if(now[i]) able ++;
   if(able + sum <= Ans) return;
   
   int tnow[N];
   for(int i = x + 1 ;i <= n ;i ++)
   tnow[i] = now[i];
   
   for(int i = x + 1 ;i <= n ;i ++)
   {
      if(!tnow[i]) continue;
      if(dp[i] + sum <= Ans) continue;
      for(int j = x + 1 ;j <= n ;j ++)
      now[j] = tnow[j] & map[i][j];
      DFS(i ,sum + 1);
   }
}


int jude(int mid)
{
   for(int i = 1 ;i <= n ;i ++)
   for(int j = i + 1 ;j <= n ;j ++)
   if(num[mid] <= dis[i][j])
   map[i][j] = map[j][i] = 1;
   else map[i][j] = map[j][i] = 0;
   
   Ans = dp[n] = 1;
   for(int i = n - 1 ;i >= 1 ;i --)
   {
      for(int j = 1 ;j <= n ;j ++)
      now[j] = map[i][j];
      DFS(i ,1);
      dp[i] = Ans;
      if(Ans >= k) return 1;
   }
   return 0;
}

double get_dis(NODE a ,NODE b)
{
   double x = (a.x - b.x) * (a.x - b.x);
   double y = (a.y - b.y) * (a.y - b.y);
   return sqrt(x + y);
}

int main ()
{
   int i ,j ,t;
   while(~scanf("%d %d" ,&n ,&k))
   {
      for(i = 1 ;i <= n ;i ++)
      scanf("%lf %lf" ,&node[i].x ,&node[i].y);
      for(t = 0 ,i = 1 ;i <= n ;i ++)
      {
         for(j = i + 1 ;j <= n ;j ++)
         {
            dis[i][j] = dis[j][i] = get_dis(node[i] ,node[j]);
            num[++t] = dis[i][j];
         }
         dis[i][i] = 0;
      }
      sort(num + 1 ,num + t + 1);
      int low = 1 ,up = t ,mid ,ans =1;
      while(low <= up)
      {
         mid = (low + up) >> 1;
         if(jude(mid))
         {
            low = mid + 1;
            ans = mid;
         }
         else 
         up = mid - 1;
      }
      printf("%.2lf\n" ,num[ans]);
   }
   return 0;
}