import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;



void main() {
    int w, h;
    scan(w, h);

    auto p = iota(w).map!(i => readln.chomp.to!long).array;
    auto q = iota(h).map!(i => readln.chomp.to!long).array;

    p.sort();
    q.sort();

    long r = h + 1;
    long c = w + 1;
    long ans;

    foreach (i ; 0 .. w + h) {
        if (p.empty) {
            ans += q.sum();
            break;
        }
        if (q.empty) {
            ans += p.sum();
            break;
        }
        if (p.front < q.front) {
            ans += p.front * r;
            p.popFront();
            c--;
        }
        else {
            ans += q.front * c;
            q.popFront();
            r--;
        }
        debug {
            writeln("ans: ", ans);
        }
    }

    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
