#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	
    vector<pair<int, int>> sor;
    
    for (int i = 0; n-1 > i; i++) {
        int temp;
        cin >> temp;
        
        sor.push_back({temp, 0});
    }
    
    for (int j = 0; m-1 > j; j++) {
        int temp;
        cin >> temp;
        
        sor.push_back({temp, 1});
    }
	
	int xSzor = 1;
	int ySzor = 1;
	
	sort(sor.rbegin(), sor.rend());
	
	int osszeg = 0;
	
	for (int i = 0; sor.size() > i; i++) {
	    int current = sor[i].first;
	    int melyik = sor[i].second;
	    
	    if (melyik == 0) {
	        osszeg += current * xSzor;
	        ySzor++;
	    } else {
	        osszeg += current * ySzor;
	        xSzor++;
	    }
	}
	
	cout << osszeg << endl;
	
    return 0;
}