#include 
     
      #include 
      
       #include 
       
        #include 
        
         using namespace std;typedef struct{    int a,b;    double v;}node;typedef struct{    int a,b;}P;const int maxn=109;double ans;int father[maxn];node graph[maxn*(maxn-1)/2];P p[maxn];int Find(int x){    if(father[x]==x)        return x;    else    {        father[x]=Find(father[x]);        return father[x];    }}void Union(int x,int y,double v){    if(Find(x)!=Find(y))    {        ans+=v*100;        father[Find(x)]=Find(y);    }    return;}bool cmp(node x,node y){    if(x.v
         
          =10)                {                    graph[k].a=i;                    graph[k].b=j;                    graph[k].v=V;                    k++;                }            }        }        sort(graph,graph+k,cmp);        for(int i=0;i