#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<cmath>using namespace std;#define maxn 100050struct Node{ int x,y,time;};Node node[maxn];double num[maxn];int numcnt;int N,K;char s[100];bool cmp(Node a,Node b){ return a.time<b.time;}bool cmp2(double a,double b){ return a>b;}double dis(Node a,Node b){ return sqrt(1.0*(a.x-b.x)*(a.x-b.x)+1.0*(a.y-b.y)*(a.y-b.y));}int main(){ int i,j; scanf("%s",s); int flag=0; while(true){ scanf("%d",&K); N=0; while(true){ if(scanf("%s",s)==EOF){ flag=1; break;} if(strcmp(s,"[HitObjects]")==0){break;} sscanf(s,"%d,%d,%d",&node[N].x,&node[N].y,&node[N].time); N++; } sort(node,node+N,cmp); numcnt=0; for(i=1;i<N;i++) num[numcnt++]=dis(node[i],node[i-1]); sort(num,num+numcnt,cmp2); if(K==1)printf("0.000n"); else printf("%.3lfn",num[K-2]); if(flag) break; } return 0;}
