import java.util.*; import java.io.*; import java.math.*; public class Main{ //見なくていいよ ここから------------------------------------------ static class InputIterator{ ArrayList inputLine = new ArrayList<>(buf); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } //入力バッファサイズのつもり。入力点数(スペース区切りでの要素数)が100万を超える場合はバッファサイズを100万にすること static int buf = 1024; static HashMap CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList nextCharArray(){return myconv(next(), 0);} static ArrayList nextStrArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList nextIntArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList nextLongArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join StringBuilder sb = new StringBuilder(""); String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof long[]){ long[] tmp = (long[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof int[]){ int[] tmp = (int[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof ArrayList){ ArrayList tmp = (ArrayList)list; if(tmp.size() == 0){ return ""; } sb.append(tmp.get(0)); for(int i = 1; i < tmp.size(); i++){ sb.append(joinString).append(tmp.get(i)); } return sb.toString(); }else{ throw new ClassCastException("Don't join"); } } static ArrayList myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList(Arrays.asList(str.split(splitString))); } static ArrayList myconv(String str, String no){ return new ArrayList(Arrays.asList(str.split(no))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //見なくていいよ ここまで------------------------------------------ //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること static void solve(){//ここがメイン関数 int N = nextInt(); int M = nextInt(); ArrayList list = new ArrayList<>(); for(int i = 0; i < N; i++){ list.add(new Node(nextLong(), true)); } for(int i = 0; i < M; i++){ list.add(new Node(nextLong(), false)); } list.add(new Node(-2000000007l, true)); list.add(new Node(2000000007l, true)); Collections.sort(list); long output = 0; ArrayList diff = new ArrayList<>(); int index = 1; while(index < N + M + 2){ while(true){ Node front = list.get(index - 1); Node now = list.get(index); diff.add(Math.abs(front.V - now.V)); index++; if(now.C){ Collections.sort(diff); for(int i = 0; i < diff.size() - 1; i++){ output += diff.get(i); } diff.clear(); break; } } } myout(output); } //メソッド追加エリア ここから static class Node implements Comparable{ long V; boolean C;//T:R, F:B Node(long V, boolean C){ this.V = V; this.C = C; } public int compareTo(Node ato){ return Long.compare(this.V, ato.V); } } //メソッド追加エリア ここまで }