Submission #9,838

2024-03-11 14:24:55

python3

Time limit exceeded 42/50

216ms

43676 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	42/50
		1	Accepted	0/0	18ms	11064 KiB
		2	Accepted	0/0	123ms	34060 KiB
		3	Accepted	1/1	17ms	11452 KiB
		4	Accepted	1/1	18ms	11740 KiB
		5	Accepted	1/1	18ms	11868 KiB
		6	Accepted	1/1	18ms	11756 KiB
		7	Accepted	1/1	18ms	12220 KiB
		8	Accepted	1/1	18ms	12392 KiB
		9	Accepted	1/1	17ms	12420 KiB
		10	Accepted	1/1	18ms	12540 KiB
		11	Accepted	1/1	17ms	12456 KiB
		12	Accepted	1/1	18ms	12744 KiB
		13	Accepted	1/1	17ms	12944 KiB
		14	Accepted	1/1	18ms	13200 KiB
		15	Accepted	1/1	18ms	13496 KiB
		16	Accepted	1/1	18ms	13252 KiB
		17	Accepted	1/1	18ms	13648 KiB
		18	Accepted	1/1	18ms	13692 KiB
		19	Accepted	2/2	18ms	13712 KiB
		20	Accepted	2/2	19ms	13804 KiB
		21	Accepted	3/3	27ms	15076 KiB
		22	Accepted	3/3	35ms	16624 KiB
		23	Accepted	4/4	71ms	26096 KiB
		24	Accepted	4/4	68ms	24992 KiB
		25	Accepted	4/4	123ms	38136 KiB
		26	Accepted	4/4	127ms	36672 KiB
		27	Time limit exceeded	0/4	216ms	43652 KiB
		28	Time limit exceeded	0/4	210ms	43676 KiB