Three Points

아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제 설명

예제1

문제

Bobo has three points, namely, point $A$ , $B$ and $C$ . And now he wants to find a point $P$ to minimize $|PA| + 2 \cdot |PB| + 3 \cdot |PC|$ .

Note that $|AB|$ denotes the Euclidian distance between points $A$ and $B$ .

입력

Each of the $3$ lines contains $2$ integers $x\_i, y\_i$ , which denotes the coordinates of point $A, B, C$ , respectively ( $|x\_i|, |y\_i| \leq 10000$ ).

출력

A single float number denotes the minimum of total distance. Absolutely or relatively error within $10^{-6}$ will get accepted.