Submission #1519520

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    w,h = LI()
    p = sorted([I() for _ in range(w)])
    q = sorted([I() for _ in range(h)])
    r = p[0] * (h+1)
    r += q[0] * (w+1)
    r -= max(p[0],q[0])
    pi = 1
    qi = 1
    for i in range(w+h-2):
        if qi == h:
            r += p[pi] * (h-qi+1)
            pi += 1
        elif pi == w:
            r += q[qi] * (w-pi+1)
            qi += 1
        elif p[pi] < q[qi]:
            r += p[pi] * (h-qi+1)
            pi += 1
        else:
            r += q[qi] * (w-pi+1)
            qi += 1

    return r

print(main())

Submission Info

Judge Result