Submission #9,839

2024-03-11 14:25:20

pypy3

Runtime error 34/50

90ms

100356 KiB

from sys import stdin
input=stdin.readline

def solv():
    n,m=[int(x) for x in input().split()]
    N=[int(x) for x in input().split()]
    M=[int(x) for x in input().split()]
    N.sort(reverse=True)
    M.sort(reverse=True)
    N.append(-1)
    M.append(-1)
    ncount=0
    mcount=0
    res=0
    i=j=0
    for _ in range(n+m-2):
        if N[i]>M[j]:
            res+=N[i]*(mcount+1)
            i+=1
            ncount+=1
        else:
            res+=M[j]*(ncount+1)
            j+=1
            mcount+=1
    print(res,end="\r\n")

solv()

	Sum	Test	Verdict		Time	Memory
base	34/50
		1	Accepted	0/0	46ms	87500 KiB
		2	Runtime error	0/0	71ms	99196 KiB
		3	Accepted	1/1	56ms	94104 KiB
		4	Accepted	1/1	50ms	94236 KiB
		5	Accepted	1/1	59ms	93824 KiB
		6	Accepted	1/1	59ms	93788 KiB
		7	Accepted	1/1	52ms	87820 KiB
		8	Accepted	1/1	59ms	93956 KiB
		9	Accepted	1/1	59ms	94192 KiB
		10	Accepted	1/1	54ms	94100 KiB
		11	Accepted	1/1	50ms	94056 KiB
		12	Accepted	1/1	59ms	94224 KiB
		13	Accepted	1/1	52ms	87308 KiB
		14	Accepted	1/1	54ms	94140 KiB
		15	Accepted	1/1	52ms	94132 KiB
		16	Accepted	1/1	61ms	94124 KiB
		17	Accepted	1/1	64ms	94168 KiB
		18	Accepted	1/1	64ms	93904 KiB
		19	Accepted	2/2	59ms	94164 KiB
		20	Accepted	2/2	64ms	94348 KiB
		21	Accepted	3/3	63ms	95416 KiB
		22	Accepted	3/3	75ms	95984 KiB
		23	Accepted	4/4	90ms	100012 KiB
		24	Accepted	4/4	89ms	98832 KiB
		25	Runtime error	0/4	79ms	100356 KiB
		26	Runtime error	0/4	67ms	95332 KiB
		27	Runtime error	0/4	75ms	95468 KiB
		28	Runtime error	0/4	67ms	95408 KiB