#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<ll> alap;

struct comp{
    bool operator()(ll a, ll b){
        return alap[a] > alap[b];
    }
};

int main()
{
    ll n, m;
    cin >> n >> m;
    n--; m--;
    ll k = n + m;

    alap.assign(k, 0);
    for(ll &x : alap) cin >> x;

    vector<ll> ind(k);
    iota(ind.begin(), ind.end(), 0);

    sort(ind.begin(), ind.end(), comp());

    ll fugg = 1, viz = 1;
    ll ans = 0;

    for(ll x : ind){
        if(x < n){ // vizszllesen megy a vagas
            ans += fugg * alap[x];
            viz++;
        } else{
            ans += viz * alap[x];
            fugg++;
        }
    }

    cout << ans << "\n";
}