#![allow(unused_imports)] use std::io::{ self, Write }; use std::str::FromStr; use std::cmp::{ min, max }; use std::collections::{ BinaryHeap, VecDeque }; #[allow(unused_macros)] macro_rules! trace { ($var:expr) => { let _ = writeln!(&mut std::io::stderr(), ">>> {} = {:?}", stringify!($var), $var); }; ($($args:expr),*) => { trace!(($($args),*)) } } const M: usize = 1_000_000_007; fn sum(ys: &Vec, r: i64) -> i64 { let mut s = 0; for &y in ys.iter() { s += abs(y - r); } s } fn minimum(ys: &Vec) -> i64 { let mut s = ys[0]; for i in 1..ys.len() { s = min(s, ys[i]); } s } fn maximum(ys: &Vec) -> i64 { let mut s = ys[0]; for i in 1..ys.len() { s = max(s, ys[i]); } s } fn abs(x: i64) -> i64 { if x < 0 { -x } else { x } } fn main() { let mut sc = Scanner::new(); let n: usize = sc.cin(); let mut ys = vec![0; n]; for i in 0..n { ys[i] = sc.cin(); } let mut left = minimum(&ys); let mut right = maximum(&ys); for _ in 0..1000 { let r1 = (left * 2 + right) / 3; let r2 = (left + right * 2) / 3; let s1 = sum(&ys, r1); let s2 = sum(&ys, r2); if s1 < s2 { right = r2; } else { left = r1; } } let mut ans = sum(&ys, 0); for r in (left-10)..(right+10) { let s = sum(&ys, r); ans = min(ans, s); } println!("{}", ans); } #[allow(dead_code)] struct Scanner { stdin: io::Stdin, buffer: VecDeque, } #[allow(dead_code)] impl Scanner { fn new() -> Scanner { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } } fn reserve(&mut self) { while self.buffer.len() == 0 { let mut line = String::new(); let _ = self.stdin.read_line(&mut line); for w in line.split_whitespace() { self.buffer.push_back(String::from(w)); } } } fn cin(&mut self) -> T { self.reserve(); match self.buffer.pop_front().unwrap().parse::() { Ok(a) => a, Err(_) => panic!("parse err") } } }