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

int ossz(int fg[], int vsz[], int n, int m) {
    int i = 0, j = 0, si = 1, sj = 1, s = 0;
    while (i < n - 1 && j < m - 1) {
        if (vsz[i] >= fg[j]) {
            s += vsz[i] * si;
            sj++;
            i++;
        } else {
            s += fg[j] * sj;
            si++;
            j++;
        }
    }
    while (i < n - 1) {
        s += vsz[i] * si;
        i++;
    }
    while (j < m - 1) {
        s += fg[j] * sj;
        j++;
    }
    return s;
}

int main() {
    ifstream f("bemenet.in");
    unsigned n, m;
    f >> n >> m;
    int vsz[n - 1], fg[m - 1];
    for (unsigned i = 0; i < n - 1; i++) {
        f >> vsz[i];
    }
    for (unsigned i = 0; i < m - 1; i++) {
        f >> fg[i];
    }
    sort(vsz, vsz + n - 1, greater<int>());
    sort(fg, fg + m - 1, greater<int>());
    ofstream g("kimenet.out");
    g<<ossz(fg,vsz, n,m);
    return 0;
}