#include<bits/stdc++.h>
using namespace std;
priority_queue<int> n1,m1;
int x,n,m,n2=1,m2=1,sum;
int main(){
    cin>>n>>m;
    for (int i=1;i<=n-1;i++){cin>>x;n1.push(x);}
    for (int i=1;i<=m-1;i++){cin>>x;m1.push(x);}//输入
    while (!n1.empty() && !m1.empty())
    {
        if (n1.top()*n2>m1.top()*m2)
        {
            sum+=n2*n1.top();
            n1.pop();
            m2++;
        }
        else
        {
            sum+=m2*m1.top();
            m1.pop();
            n2++;

        }

    }
    if (!n1.empty())
    {
        while (!n1.empty()){sum+=n1.top()*n2;n1.pop();}
    }
    else
    {
        while (!m1.empty()){sum+=m1.top()*m2;m1.pop();}
    }
    cout<<sum;
    return 0;
}