#include<bits/stdc++.h>
using namespace std;
struct xiaoxiong{
	int yd,xd,mx;
	xiaoxiong(int yd=0,int xd=0,int mx=0):yd(yd),xd(xd),mx(mx){}
	bool operator<(const xiaoxiong &other)const{
		return 1ll*yd*other.xd>1ll*other.yd*xd;
	}
};
int a[100005],b[100005];
int nxt1[100005],pre1[100005];
int nxt2[100005],pre2[100005];
int hs[100005],ls[100005];
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	for(int i=1;i<=m;++i)scanf("%d",&b[i]);
	set<xiaoxiong>se;
	for(int i=1;i<=n;++i)nxt1[i]=i+1,pre1[i]=i-1;
	for(int i=1;i<=m;++i)nxt2[i]=i+1,pre2[i]=i-1;
	for(int i=1;i<n;++i){
		se.emplace(a[i+1]-a[i],1,i+1);
	}
	for(int i=1;i<m;++i){
		se.emplace(b[i+1]-b[i],1,n+i+1);
	}
	long long ans=0;
	int ABC=1,ARC=1;
	int AGC=n,AHC=m;
	while(se.size()){
		auto it=se.begin();
		auto cu=*it;
		se.erase(it);
		if(cu.mx<=n){
			int x=cu.mx;
			hs[x]=1;
			int L=pre1[x],R=nxt1[x];
			nxt1[L]=R,pre1[R]=L;
			if(L>0&&R<=n){
				se.emplace(a[R]-a[L],R-L,R);
			}
			while(hs[ABC]&&ls[ARC]){
				ans+=a[ABC];
				++ARC;
			}
			while(hs[AGC]&&ls[AHC]){
				ans+=a[AGC];
				--AHC;
			}
		}else{
			int x=cu.mx-n;
			ls[x]=1;
			int L=pre2[x],R=nxt2[x];
			nxt2[L]=R,pre2[R]=L;
			if(L>0&&R<=m){
				se.emplace(b[R]-b[L],R-L,n+R);
			}
			while(hs[ABC]&&ls[ARC]){
				ans+=b[ARC];
				++ABC;
			}
			while(hs[AGC]&&ls[AHC]){
				ans+=b[AHC];
				--AGC;
			}
		}
	}
	assert(ABC==AGC||ARC==AHC);
	if(ABC==AGC){
		ans+=1ll*(AHC-ARC)*a[ABC];
	}else{
		ans+=1ll*(AGC-ABC)*b[AHC];
	}
	cout<<ans<<endl;
	return 0;
}