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

int main() {
    unsigned n, m;
    ifstream f("bemenet.in");
    f >> n >> m;

    int* vizszintes = new int[n - 1];
    int* fuggoleges = new int[m - 1];

    for (unsigned i = 0; i < n - 1; i++) {
        f >> vizszintes[i];
    }
    for (unsigned i = 0; i < m - 1; i++) {
        f >> fuggoleges[i];
    }

    sort(vizszintes, vizszintes + n - 1, greater<int>());
    sort(fuggoleges, fuggoleges + m - 1, greater<int>());

    unsigned s = 0, szf = 1, szv = 1;
    unsigned indf = 0, indv = 0;

    while (indf < m - 1 || indv < n - 1) {
        if (indf >= m - 1 || (indv < n - 1 && vizszintes[indv] >= fuggoleges[indf])) {
            s += vizszintes[indv] * szv;
            szf++;
            indv++;
        } else {
            s += fuggoleges[indf] * szf;
            szv++;
            indf++;
        }
    }

    ofstream g("kimenet.out");
    g << s;

    delete[] vizszintes;
    delete[] fuggoleges;

    return 0;
}