#include <bits/stdc++.h>

using namespace std;

int N, M;
int ver[100002], hor[100002];

int main(){
    cin >> N >> M;
    for(int i = 1; i < N; i++) cin >> ver[i];

    for(int i = 1; i < M; i++) cin >> hor[i];


    sort(ver + 1, ver + N, greater<int>());
    sort(hor + 1, hor + M, greater<int>());

    long long ans = 0;
    int vdb = 0, hdb = 0;

    int i = 1, j = 1;
    while(i <= N - 1 and j <= M - 1){
        if(ver[i] > hor[j]){
            ans = ans + 1LL * (hdb + 1) * ver[i];
            i = i + 1;
            vdb = vdb + 1;
        }
        else{
            ans = ans + 1LL * (vdb + 1) * hor[j];
            j = j + 1;
            hdb = hdb + 1;
        }
    }

    for(int k = i; k < N; k++){
        ans = ans + 1LL * (hdb + 1) * ver[k];
    }

    for(int k = j; k < M; k++){
        ans = ans + 1LL * (vdb + 1) * hor[k];
    }

    cout << ans;
    return 0;
}