bobo 有 3 个点，分别是点 $A$、$B$ 和 $C$。现在他想找到一个点 $P$，使得 $|PA| + 2 \cdot |PB| + 3 \cdot |PC|$ 最小。
注意 $|AB|$ 表示点 $A$ 和点 $B$ 之间的欧几里得距离。
输入共有 3 行，每行包含 2 个整数 $x_i, y_i$，分别表示点 $A$、$B$、$C$ 的坐标（$|x_i|, |y_i| \le 10000$）。
输出一个浮点数，表示最小的总距离。绝对误差或相对误差在 $10^{-6}$ 以内均可被接受。
0 0 0 0 1 0
3.000000000
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: