#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  n = m = 100000;
  cin >> n >> m;
  vector<unsigned long long> a(n);
  unsigned long long suma = 0;
  for (int i = 0; i < n; i++) {
    a[i] = 1000000000;
    cin >> a[i];
    suma += a[i];
  }
  vector<unsigned long long> b(m);
  unsigned long long sumb = 0;
  for (int i = 0; i < m; i++) {
    b[i] = 1000000000;
    cin >> b[i];
    sumb += b[i];
  }
  priority_queue<unsigned long long> pqa;
  for (int i = 0; i < n; i++) pqa.push(a[i]);
  priority_queue<unsigned long long> pqb;
  for (int i = 0; i < m; i++) pqb.push(b[i]);
  unsigned long long sega = 0;
  bool primRes = true;
  unsigned long long minRes = 0;
  unsigned long long sa = suma;
  while (pqa.size()) {
    unsigned long long val = pqa.top();
    pqa.pop();
    sa -= val;
    sega++;
    unsigned long long costo1 = sa + sumb * sega;
    if (primRes) {
      primRes = false;
      minRes = costo1;
    } else {
      minRes = min(minRes, costo1);
    }
  }
  unsigned long long segb = 0;
  unsigned long long sb = sumb;
  while (pqb.size()) {
    unsigned long long val = pqb.top();
    pqb.pop();
    sb -= val;
    segb++;
    unsigned long long costo1 = sb + suma * segb;
    if (primRes) {
      primRes = false;
      minRes = costo1;
    } else {
      minRes = min(minRes, costo1);
    }
  }
  cout << minRes << endl;
  return 0;
}
