pub mod chminmax { pub fn chmin(a: &mut T, b: &T) -> bool { if *a > *b { *a = *b; true } else { false } } pub fn chmax(a: &mut T, b: &T) -> bool { if *a < *b { *a = *b; true } else { false } } } pub mod scanner { pub struct Scanner { buf: Vec, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec { source .split_whitespace() .rev() .map(String::from) .collect::>() } } } use crate::{chminmax::chmin, scanner::Scanner}; fn main() { let mut scanner = Scanner::new(); let t: usize = 1; for _ in 0..t { solve(&mut scanner); } } fn solve(scanner: &mut Scanner) { let n: usize = scanner.next(); let mut xy = vec![(0, 0); n]; for i in 0..n { let x = scanner.next::(); let y = scanner.next::(); xy[i] = (x, y); } let mut ans: usize = !0; for xi in 1..=300 { for yi in 1..=300 { let mut now: usize = 0; for ni in 0..n { let (x, y) = xy[ni]; now += xi.max(x) - xi.min(x); now += yi.max(y) - yi.min(y); } chmin(&mut ans, &now); } } println!("{}", ans); }