Problem:
Score : 600 points

Problem Statement

Takahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \left(x_i, y_i\right), and its hardness is c_i.

Takahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \left(X, Y\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \times \sqrt{\left(X - x_i\right)^2 + \left(Y-y_i\right)^2} seconds.

Takahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.

Constraints

All values in input are integers.

1 \leq N \leq 60

1 \leq K \leq N

-1000 \leq x_i , y_i \leq 1000

\left(x_i, y_i\right) \neq \left(x_j, y_j\right) \left(i \neq j \right)

1 \leq c_i \leq 100

Input

Input is given from Standard Input in the following format:

N K
x_1 y_1 c_1
\vdots
x_N y_N c_N

Output

Print the answer.

It will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.

Sample Input 1

4 3
-1 0 3
0 0 3
1 0 2
1 1 40

Sample Output 1

2.4

If we put the heat source at \left(-0.2, 0\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.

Sample Input 2

10 5
-879 981 26
890 -406 81
512 859 97
362 -955 25
128 553 17
-885 763 2
449 310 57
-656 -204 11
-270 76 40
184 170 16

Sample Output 2

7411.2252

Solution in Rust (1.15.1) (judge verdict: Accepted)

#[allow(unused_imports)]
use std::cmp;
use std::io::Write;

// Input macro from https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
  (source = $s:expr, $($r:tt)*) => {
    let mut iter = $s.split_whitespace();
    input_inner!{iter, $($r)*}
  };
  ($($r:tt)*) => {
    let s = {
      use std::io::Read;
      let mut s = String::new();
      std::io::stdin().read_to_string(&mut s).unwrap();
      s
    };
    let mut iter = s.split_whitespace();
    input_inner!{iter, $($r)*}
  };
}

macro_rules! input_inner {
  ($iter:expr) => {};
  ($iter:expr, ) => {};

  ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
    let $var = read_value!($iter, $t);
    input_inner!{$iter $($r)*}
  };
}

macro_rules! read_value {
  ($iter:expr, ( $($t:tt),* )) => {
    ( $(read_value!($iter, $t)),* )
  };

  ($iter:expr, [ $t:tt ; $len:expr ]) => {
    (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
  };

  ($iter:expr, chars) => {
    read_value!($iter, String).chars().collect::<Vec<char>>()
  };

  ($iter:expr, usize1) => {
    read_value!($iter, usize) - 1
  };

  ($iter:expr, [ $t:tt ]) => {{
    let len = read_value!($iter, usize);
    (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
  }};

  ($iter:expr, $t:ty) => {
    $iter.next().unwrap().parse::<$t>().expect("Parse error")
  };
}

#[derive(PartialEq, PartialOrd, Clone, Copy, Debug)]
pub struct Total<T>(pub T);

impl<T: PartialEq> Eq for Total<T> {}

impl<T: PartialOrd> Ord for Total<T> {
    fn cmp(&self, other: &Total<T>) -> std::cmp::Ordering {
        self.0.partial_cmp(&other.0).unwrap()
    }
}

#[allow(dead_code)]
const EPS: f64 = 1e-6;

#[derive(Copy, Clone, Debug)]
struct Point {
  x: f64,
  y: f64,
}
impl Point {
  #[allow(dead_code)]
  fn new(x: f64, y: f64) -> Self {
    Point {
      x: x,
      y: y,
    }
  }
  #[allow(dead_code)]
  // divide a segment into; ratio : 1 - ratio
  fn division(self, other: Self, ratio: f64) -> Self {
    self + (other - self) * ratio
  }
  #[allow(dead_code)]
  fn dist(self, other: Self) -> f64 {
    (other - self).abs()
  }
  #[allow(dead_code)]
  fn line_with_normal(self, vec: Vect) -> Line {
    let vec = vec.normalized();
    Line {
      a: vec.x,
      b: vec.y,
      c: -self.x * vec.x - self.y * vec.y,
    }
  }
  #[allow(dead_code)]
  fn line_toward(self, vec: Vect) -> Line {
    self.line_with_normal(vec.normal_vect())
  }
  #[allow(dead_code)]
  fn line_between(self, other: Point) -> Line {
    self.line_toward(other - self)
  }
  #[allow(dead_code)]
  fn bisector(self, other: Point) -> Line {
    let midpoint = self.division(other, 0.5);
    midpoint.line_with_normal(other - self)
  }
  #[allow(dead_code)]
  fn dist_to_line(self, line: Line) -> f64 {
    (line.a * self.x + line.b * self.y + line.c).abs()
  }
  #[allow(dead_code)]
  fn apollonius(self, other: Point, r1: f64, r2: f64) -> Option<Curve> {
    use Curve::*;
    if self.dist(other) < EPS || r1 < EPS || r2 < EPS {
      return None;
    }
    if (r1 - r2).abs() < EPS {
      return Some(CLine(self.bisector(other)));
    }
    let p1 = self.division(other, r1 / (r1 + r2));
    let p2 = self.division(other, r1 / (r1 - r2));
    Some(CCircle(Circle::new(p1.division(p2, 0.5), p1.dist(p2) / 2.0)))
  }
  #[allow(dead_code)]
  fn perpendicular(self, line: Line) -> Line {
    self.line_toward(line.normal_vect())
  }
}
impl<T: Into<Vect>> std::ops::Add<T> for Point {
  type Output = Point;
  fn add(self, other: T) -> Point {
    let other = other.into();
    Point {
      x: self.x + other.x,
      y: self.y + other.y,
    }
  }
}
impl std::ops::Sub<Point> for Point {
  type Output = Vect;
  fn sub(self, other: Point) -> Vect {
    Vect {
      x: self.x - other.x,
      y: self.y - other.y,
    }
  }
}
impl<T: Into<Vect>> std::ops::Sub<T> for Point {
  type Output = Point;
  fn sub(self, other: T) -> Point {
    let other = other.into();
    Point {
      x: self.x - other.x,
      y: self.y - other.y,
    }
  }
}
impl From<(f64, f64)> for Point {
  fn from(p: (f64, f64)) -> Self {
    Point::new(p.0, p.1)
  }
}

#[derive(Copy, Clone, Debug)]
struct Vect {
  x: f64,
  y: f64,
}
impl Vect {
  #[allow(dead_code)]
  fn new(x: f64, y: f64) -> Vect {
    Vect {
      x: x,
      y: y,
    }
  }
  #[allow(dead_code)]
  fn from_angle(theta: f64) -> Vect {
    Vect {
      x: theta.cos(),
      y: theta.sin(),
    }
  }
  #[allow(dead_code)]
  fn norm(self) -> f64 {
    self.x.powi(2) + self.y.powi(2)
  }
  #[allow(dead_code)]
  fn abs(self) -> f64 {
    self.norm().sqrt()
  }
  #[allow(dead_code)]
  fn normal_vect(self) -> Vect {
    Vect {
      x: -self.y,
      y: self.x,
    }
  }
  #[allow(dead_code)]
  fn normalized(self) -> Vect {
    self / self.abs()
  }
}
impl<T: Into<Vect>> std::ops::Add<T> for Vect {
  type Output = Vect;
  fn add(self, other: T) -> Vect {
    let other = other.into();
    Vect {
      x: self.x + other.x,
      y: self.y + other.y,
    }
  }
}
impl<T: Into<Vect>> std::ops::Sub<T> for Vect {
  type Output = Vect;
  fn sub(self, other: T) -> Vect {
    let other = other.into();
    Vect {
      x: self.x - other.x,
      y: self.y - other.y,
    }
  }
}
impl std::ops::Mul<f64> for Vect {
  type Output = Vect;
  fn mul(self, other: f64) -> Vect {
    Vect {
      x: self.x * other,
      y: self.y * other,
    }
  }
}
impl std::ops::Div<f64> for Vect {
  type Output = Vect;
  fn div(self, other: f64) -> Vect {
    Vect {
      x: self.x / other,
      y: self.y / other,
    }
  }
}
impl<T: Into<Vect>> std::ops::AddAssign<T> for Vect {
  fn add_assign(&mut self, other: T) {
    *self = *self + other;
  }
}
impl<T: Into<Vect>> std::ops::SubAssign<T> for Vect {
  fn sub_assign(&mut self, other: T) {
    *self = *self - other;
  }
}
impl std::ops::MulAssign<f64> for Vect {
  fn mul_assign(&mut self, other: f64) {
    *self = *self * other;
  }
}
impl From<(f64, f64)> for Vect {
  fn from(p: (f64, f64)) -> Self {
    Vect::new(p.0, p.1)
  }
}

#[derive(Copy, Clone, Debug)]
struct Line {
  // ax + by + c = 0
  a: f64,
  b: f64,
  c: f64,
}
impl Line {
  #[allow(dead_code)]
  fn new(a: f64, b: f64, c: f64) -> Self {
    let scale = (a.powi(2) + b.powi(2)).sqrt();
    Line {
      a: a / scale,
      b: b / scale,
      c: c / scale,
    }
  }
  #[allow(dead_code)]
  fn intersection(self, other: Line) -> Option<Point> {
    let det = self.a * other.b - self.b * other.a;
    if det.abs() < EPS {
      return None;
    }
    Some(Point {
      x: (-other.b * self.c + self.b * other.c) / det,
      y: (other.a * self.c - self.a * other.c) / det,
    })
  }
  #[allow(dead_code)]
  fn normal_vect(self) -> Vect {
    Vect::new(self.a, self.b)
  }
}
#[derive(Copy, Clone, Debug)]
struct Circle {
  center: Point,
  radius: f64,
}
impl Circle {
  #[allow(dead_code)]
  fn new(center: Point, radius: f64) -> Self {
    Circle {
      center: center,
      radius: radius
    }
  }
  #[allow(dead_code)]
  fn intersection_with_line(self, line: Line) -> Vec<Point> {
    let perpendicular = self.center.perpendicular(line);
    let foot = line.intersection(perpendicular).unwrap();
    let dist = self.center.dist_to_line(line);
    if (dist - self.radius).abs() < EPS {
      return vec![foot];
    }
    // dbg!((dist, self.radius));
    if dist > self.radius {
      return vec![];
    }
    let base = (self.radius.powi(2) - dist.powi(2)).sqrt();
    let v = perpendicular.normal_vect() * base;
    vec![foot + v, foot - v]
  }
  #[allow(dead_code)]
  fn intersection_with_circle(self, other: Circle) -> Vec<Point> {
    let dist = self.center.dist(other.center);
    if dist < EPS {
      return vec![];
    }
    fn diff(c: Circle) -> f64 {
      c.radius.powi(2) - c.center.x.powi(2) - c.center.y.powi(2)
    }
    let c = (diff(self) - diff(other)) / 2.0;
    let v = self.center - other.center;
    let line = Line::new(v.x, v.y, c);
    // dbg!((self, other, line));
    self.intersection_with_line(line)
  }
}
#[derive(Copy, Clone, Debug)]
enum Curve {
  CLine(Line),
  CCircle(Circle),
}
impl Curve {
  #[allow(dead_code)]
  fn intersection(self, other: Curve) -> Vec<Point> {
    use Curve::*;
    match (self, other) {
      (CLine(l1), CLine(l2)) => {
        l1.intersection(l2).into_iter().collect()
      },
      (CLine(l), CCircle(c)) | (CCircle(c), CLine(l)) => {
        c.intersection_with_line(l)
      },
      (CCircle(c1), CCircle(c2)) => {
        c1.intersection_with_circle(c2)
      }
    }
  }
}

fn main() {
  let out = std::io::stdout();
  let mut out = std::io::BufWriter::new(out.lock());
  macro_rules! puts {
    ($($format:tt)*) => (write!(out,$($format)*).unwrap());
  }
  input! {
    n: usize,
    k: usize,
    meat: [(f64, f64, f64); n],
  }
  let meat: Vec<_> = meat.into_iter().map(|(a, b, c)| (Point::new(a, b), c)).collect();
  let time = |p: Point| {
    let mut times = vec![];
    for &(q, c) in &meat {
      let x = p.dist(q) * c;
      times.push(Total(x));
    }
    times.sort();
    times[k-1]
  };
  let mut ans = Total(1.0 / 0.0);
  for i in 0 .. n {
    ans = cmp::min(ans, time(meat[i].0));
  }
  for i in 0 .. n {
    let (pi, ci) = meat[i];
    for j in 0 .. i {
      let (pj, cj) = meat[j];
      let p = pi.division(pj, cj / (ci + cj));
      ans = cmp::min(ans, time(p));
    }
  }
  let get_curve = |(p1, c1): (Point, f64), (p2, c2): (Point, f64)| {
    p1.apollonius(p2, c2, c1)
  };
  for i in 0 .. n {
    for j in 0 .. i {
      let l1 = get_curve(meat[i], meat[j]);
      for l in 0 .. j {
        let l2 = get_curve(meat[i], meat[l]);
        if let (Some(l1), Some(l2)) = (l1, l2) {
          // dbg!((l1, l2, l1.intersection(l2)));
          for q in l1.intersection(l2) {
            ans = cmp::min(ans, time(q));
          }
        }
      }
    }
  }

  puts!("{:.15}\n", ans.0);
}