#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

const int MAXN=2020;

int n,m,i,j,k,h1,h2,a[MAXN],b[MAXN],ans=0;

void init()
{
	freopen("cut.in","r",stdin);
	freopen("cut.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (i=1;i<n;i++)
		scanf("%d",&a[i]);
	for (j=1;j<m;j++)
		scanf("%d",&b[j]);
	sort(a+1,a+n);
	sort(b+1,b+m);
	h1=1;
	h2=1;
}

void solve()
{
	i=n-1;
	j=m-1;
	while (i || j)
	{
		if ( (!i) || (j && i && b[j]>a[i]))
		{
			ans+=b[j]*h1;
			h2++;
			j--;
			continue;
		}
		else
		{
			ans+=a[i]*h2;
			h1++;
			i--;
			continue;
		}
	}
	printf("%d\n",ans);
}

int main()
{
	init();
	solve();
	return 0;
}