#include <iostream> #include <algorithm> #include <math.h> #include <iomanip> using namespace std; #define N 100005 #define ll long long #define ld long double const ld oo = 99999999999999; int xa, ya, xb, yb, xc, yc; int n; ll x[N], y[N]; ld kc[N]; ld s = 0; void enter() { scanf("%d%d%d%d%d%d%d", &xa, &ya, &xb, &yb, &xc, &yc, &n); for (int i = 1; i <= n; i++) { scanf("%lld%lld", &x[i], &y[i]); kc[i] = sqrtl((x[i] - xc) * (x[i] - xc) + (y[i] - yc) * (y[i] - yc)); s += kc[i] * 2; } } void solve() { // quickSort(kc, x, y, 1, n); ld spi = oo; ld ans; ld lv = oo; int vt2; int vt1; for (int i = 1; i <= n; i++) { ld kc1 = sqrtl((x[i] - xa) * (x[i] - xa) + (y[i] - ya) * (y[i] - ya)); if (s - kc[i] + kc1 < spi) spi = s - kc[i] + kc1, vt1 = i; } for (int i = 1; i <= n; i++) { ld kc1 = sqrtl((x[i] - xb) * (x[i] - xb) + (y[i] - yb) * (y[i] - yb)); if ((i != vt1 || n == 1) && spi - kc[i] + kc1 < lv) lv = spi - kc[i] + kc1; } if (spi == oo) spi = 0; if (lv == oo) lv = 0; if (lv > spi) ans = spi; else ans = lv; lv = spi = oo; for (int i = 1; i <= n; i++) { ld kc1 = sqrtl((x[i] - xb) * (x[i] - xb) + (y[i] - yb) * (y[i] - yb)); if (s - kc[i] + kc1 < lv) lv = s - kc[i] + kc1, vt2 = i; } for (int i = 1; i <= n; i++) { ld kc1 = sqrtl((x[i] - xa) * (x[i] - xa) + (y[i] - ya) * (y[i] - ya)); if ((i != vt2 || n == 1) && lv - kc[i] + kc1 < spi) spi = lv - kc[i] + kc1; } if (spi == oo) spi = 0; if (lv == oo) lv = 0; if (lv < spi) spi = lv; if (ans > spi) ans = spi; std::cout << std::fixed; std::cout << std::setprecision(5) << ans; } int main() { enter(); solve(); }