#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	long long n, m, r = 1, c = 1, cost = 0;
	cin >> n >> m;
	vector<long long> hor(n, 0);
	vector<long long> ver(m, 0);
	for (int i = 0; i < n - 1; i++) cin >> hor[i];
	for (int i = 0; i < m - 1; i++) cin >> ver[i];
	sort(hor.begin(), hor.end());
	sort(ver.begin(), ver.end());
	for (int i = 0; i < n - 1 + m - 1; i++) {
		if (ver.back() > hor.back()) {
			c++;
			cost += r * ver.back();
			ver.pop_back();
		}
		else {
			r++;
			cost += c * hor.back();
			hor.pop_back();
		}
	}
	cout << cost;
	return 0;
}