Submission #9,843

2024-03-11 14:43:29

python3

Time limit exceeded 42/50

209ms

43268 KiB

from sys import stdin
input=stdin.readline

def solv():
    n,m=map(int,input().split())
    #N=[int(x) for x in input().split()]
    N=list(map(int,input().split()))
    M=list(map(int,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)

solv()

	Sum	Test	Verdict		Time	Memory
base	42/50
		1	Accepted	0/0	17ms	11156 KiB
		2	Accepted	0/0	119ms	33988 KiB
		3	Accepted	1/1	17ms	11664 KiB
		4	Accepted	1/1	18ms	12008 KiB
		5	Accepted	1/1	18ms	12364 KiB
		6	Accepted	1/1	18ms	12148 KiB
		7	Accepted	1/1	18ms	12316 KiB
		8	Accepted	1/1	17ms	12192 KiB
		9	Accepted	1/1	18ms	12408 KiB
		10	Accepted	1/1	18ms	12608 KiB
		11	Accepted	1/1	18ms	12804 KiB
		12	Accepted	1/1	17ms	12672 KiB
		13	Accepted	1/1	17ms	12404 KiB
		14	Accepted	1/1	18ms	12852 KiB
		15	Accepted	1/1	18ms	13068 KiB
		16	Accepted	1/1	18ms	13272 KiB
		17	Accepted	1/1	19ms	13604 KiB
		18	Accepted	1/1	18ms	13388 KiB
		19	Accepted	2/2	18ms	13648 KiB
		20	Accepted	2/2	19ms	13816 KiB
		21	Accepted	3/3	26ms	15188 KiB
		22	Accepted	3/3	34ms	16468 KiB
		23	Accepted	4/4	68ms	25724 KiB
		24	Accepted	4/4	67ms	24644 KiB
		25	Accepted	4/4	120ms	37676 KiB
		26	Accepted	4/4	119ms	36164 KiB
		27	Time limit exceeded	0/4	209ms	43268 KiB
		28	Time limit exceeded	0/4	204ms	43076 KiB