#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::(); let (n, d) = (v[0], v[1]); let mut negs = vec![]; for i in 0..n { let v = read_vec::(); let (p, q) = (v[0], v[1]); negs.push((p, q)); } let criterion = |mid: i64| -> bool { let mut dp = vec![vec![-std::i64::MAX / 4; n]; d]; for (i, &(p, q)) in negs.iter().enumerate() { if -p >= mid { dp[0][i] = q - p; } } for di in 1..d { let mut from_left = vec![0; n]; from_left[0] = dp[di - 1][0]; for i in 1..n { from_left[i] = max(from_left[i - 1], dp[di - 1][i]); } let mut from_right = vec![0; n]; from_right[n - 1] = dp[di - 1][n - 1]; for i in (0..n - 1).rev() { from_right[i] = max(from_right[i + 1], dp[di - 1][i]); } for (i, &(p, q)) in negs.iter().enumerate() { let mut cand_from = -std::i64::MAX / 4; if i > 0 { cand_from = from_left[i - 1]; } if i < n - 1 { cand_from = max(from_right[i + 1], cand_from); } if cand_from != -std::i64::MAX / 4 && cand_from - p >= mid { dp[di][i] = cand_from + p - q; } } } *dp[d - 1].iter().max().unwrap() >= mid }; let (ok, ng) = binary_search(-(d as i64) * 100000000 - 1, 0, criterion); println!("{}", ok); } type Input = i64; fn binary_search(lb: Input, ub: Input, criterion: F) -> (Input, Input) where F: Fn(Input) -> bool, { assert_eq!(criterion(lb), true); assert_eq!(criterion(ub), false); let mut ok = lb; let mut ng = ub; while ng - ok > 1 { let mid = (ng + ok) / 2; if criterion(mid) { ok = mid; } else { ng = mid; } } (ok, ng) } fn read() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec() -> Vec { read::() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() }