use std::collections::{BTreeSet, HashMap};


struct UnionFind {
    n: usize,
    parents: Vec<usize>,
    depths: Vec<usize>,
    chains: Vec<usize>,
}

impl UnionFind {
    fn new(n: usize) -> Self {
        UnionFind {
            n: n,
            parents: (0..n).collect(),
            depths: vec![0; n],
            chains: vec![1; n],
        }
    }

    fn equiv(&mut self, a: usize, b: usize) -> bool {
        self.find(a) == self.find(b)
    }
    
    fn unite(&mut self, a: usize, b: usize) {
        if self.equiv(a, b) { return; }
        let x = self.parents[a];
        let y = self.parents[b];
        if self.depths[x] > self.depths[y] {
            self.parents[x] = self.parents[y];
            self.chains[y] += self.chains[x];
        } else {
            self.parents[y] = self.parents[x];
            self.chains[x] += self.chains[y];
            if self.depths[x] == self.depths[y] {
                self.depths[x] += 1;
            }
        }
    }

    fn find(&mut self, a: usize) -> usize {
        if self.parents[a] == a { return a; }
        let p = self.find(self.parents[a]);
        self.parents[a] = p;
        p
    }

    fn chain_cnt(&mut self, i: usize) -> usize {
        let idx = self.find(i);
        self.chains[idx]
    }
}

fn main() {
    let mut nm = String::new();
    std::io::stdin().read_line(&mut nm).ok();
    let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nm[0];
    let m = nm[1];
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut b = String::new();
    std::io::stdin().read_line(&mut b).ok();
    let b: Vec<usize> = b.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut vals = a.clone().to_owned();
    for &v in b.iter() { vals.push(v); }
    vals.sort();
    let mapping = (0..n+m).map(|i| (vals[i], i)).collect::<HashMap<usize, usize>>();
    let revmap = vals;
    let a = a.iter().map(|&v| *mapping.get(&v).unwrap()).collect::<Vec<usize>>();
    let b = b.iter().map(|&v| *mapping.get(&v).unwrap()).collect::<Vec<usize>>();
    let mut uf = UnionFind::new(n+m);
    for i in 0..n-1 { uf.unite(a[i], a[i+1]); }
    let mut lines = b.iter().flat_map(|&i| {
            let mut ret = vec![];
            if i > 0 { ret.push((i-1, i, revmap[i]-revmap[i-1])); }
            if i+1 < n+m { ret.push((i, i+1, revmap[i+1]-revmap[i])); }
            ret
        })
        .collect::<Vec<_>>();
    lines.sort_by_key(|&(_, _, v)| v);
    let mut result = 0usize;
    for &(u, v, cost) in lines.iter() {
        if uf.find(u) == uf.find(v) { continue; }
        uf.unite(u, v);
        result += cost;
    }
    println!("{}", result);
}