问题 1913 --Freckles

1913: Freckles

时间限制: 1 Sec  内存限制: 32 MB  Special Judge
提交: 110  解决: 92
[提交][状态][讨论版][数据上传:][下载FPS1元][下载测试数据1元][28kb]

题目描述

In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through. 
Consider Dick's back to be a plane with freckles at various (x,y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence of connected lines from any freckle to any other freckle.

输入

The first line contains 0 < n <= 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the freckle.

输出

Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the freckles.

样例输入

3
2723.62 7940.81
8242.67 11395.00
4935.54 6761.32
9
10519.52 11593.66
12102.35 2453.15
7235.61 10010.83
211.13 4283.23
5135.06 1287.85
2337.48 2075.61
6279.72 13928.13
65.79 1677.86
5324.26 125.56
0

样例输出

8199.56
32713.73

提示

来源

[提交][状态]