#include <bits/stdc++.h>
using namespace std;
const long long mod7 = 1000000007;
const long long mod9 = 1000000009;
const int linf = 2000000000;
const long long llinf = 1000000000000000000ll;
long long ar1[100001];
long long ar2[100001];
long long ans1, ans2;
long long sum1, sum2;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &ar1[i]);
    sum1 += ar1[i];
  }
  for (int i = 0; i < m; ++i) {
    scanf("%lld", &ar2[i]);
    sum2 += ar2[i];
  }
  sort(ar1, ar1 + n, greater<long long>());
  sort(ar2, ar2 + m, greater<long long>());
  for (int i = 1; i < n; ++i) {
    ans1 += min(ar1[i], sum2);
  }
  for (int i = 1; i < m; ++i) {
    ans2 += min(ar2[i], sum1);
  }
  printf("%lld", min(ans1 + sum2, ans2 + sum1));
  return 0;
}
