#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<pair<int, pair<int, int>>>edge;//{距離,{x,y}}
long long MinimumSpanningTree(int n) {
	cout << n << endl;
	sort(edge.begin(), edge.end());
	dsu uf(n);
	long long ans = 0;
	for (auto e : edge) {
		int cost = e.first;
		int a = e.second.first;
		int b = e.second.second;
		if (!uf.same(a, b)) {
			uf.merge(a, b);
			ans += cost;
		}
	}
	//if (n != uf.size(0)) ans = -1;
	return ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<P>ab;
	rep(i, n) {
		int a; cin >> a;
		ab.push_back({ a,0 });
	}
	rep(i, m) {
		int b; cin >> b;
		ab.push_back({ b,1 });
	}
	sort(all(ab));
	rep(i, ab.size()) {
		if (0 == ab[i].second)edge.push_back({ 0,{i,n + m} });
		if (0 != i)edge.push_back({ ab[i].first - ab[i - 1].first,{i - 1,i} });
	}
	cout << MinimumSpanningTree(n + m + 1) << endl;
	return 0;
}