#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<int, int>;
int RED = 0, BLUE = 1;


struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) {}
    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
        if (data[y] < data[x]) swap(x, y);
        data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

using T = tuple<ll, int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<P> p;
    for(int i = 0; i < n; i++){
        int a; cin >> a;
        p.push_back(P(a, RED)); 
    }
    for(int i = 0; i < m; i++){
        int b; cin >> b;
        p.push_back(P(b, BLUE)); 
    }
    sort(p.begin(), p.end());
    int root = 0;
    priority_queue<T, vector<T>, greater<T>> t;
    for(int i = 0; i < n+m; i++){
        auto [x, col] = p[i];
        int idx = i+1;
        if(col == RED) t.push(T(0, root, idx));
        if(i > 0){
            auto [x_pre, _] = p[i-1];
            t.push(T(x-x_pre, idx-1, idx));
        }
    }
    ll ans = 0;
    UnionFind uf(n+m+1);
    while(uf.size(root) != n+m+1){
        auto [w, i, j] = t.top(); t.pop();
        if(uf.findSet(i, j)) continue;
        // if(i != 0) cout << p[i-1].first << ' ' << p[j-1].first << endl;
        ans += w;
        uf.unionSet(i, j);
    }
    cout << ans << endl;
}