#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> v1, v2;
    int x;
    for (int i=1; i < n; i++) {
        cin >> x;
        v1.push_back(x);
    }
    for (int i=1; i < m; i++) {
        cin >> x;
        v2.push_back(x);
    }

    sort(v1.begin(), v1.end(), greater<int>());
    sort(v2.begin(), v2.end(), greater<int>());

    int left = 0, top = 0;
    int vert_cnt = 1, hor_cnt = 1;
    long long res = 0;
    while (top < v1.size() && left < v2.size()) {
        if (v1[top] > v2[left]) {
            res += v1[top] * hor_cnt;
            top++;
            vert_cnt++;
        } else {
            res += v2[left] * vert_cnt;
            hor_cnt++;
            left++;
        }
    }
    while (top < v1.size()) {
        res += v1[top] * hor_cnt;
        top++;
    }
    while (left < v2.size()) {
        res += v2[left] * vert_cnt;
        left++;
    }
    cout << res << '\n';
    return 0;
}