Submission #9,840

2024-03-11 14:32:01

python3

Time limit exceeded 42/50

207ms

43820 KiB

from sys import stdin
input=stdin.readline

def solv():
    n,m=[int(x) for x in input().split()]
    N=list(map(int,input().split()))
    #N=[int(x) for x in 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	11240 KiB
		2	Accepted	0/0	115ms	34264 KiB
		3	Accepted	1/1	18ms	11788 KiB
		4	Accepted	1/1	18ms	12256 KiB
		5	Accepted	1/1	17ms	12476 KiB
		6	Accepted	1/1	17ms	12100 KiB
		7	Accepted	1/1	17ms	12412 KiB
		8	Accepted	1/1	17ms	12572 KiB
		9	Accepted	1/1	17ms	12840 KiB
		10	Accepted	1/1	17ms	12940 KiB
		11	Accepted	1/1	17ms	12924 KiB
		12	Accepted	1/1	18ms	13100 KiB
		13	Accepted	1/1	17ms	12916 KiB
		14	Accepted	1/1	17ms	13208 KiB
		15	Accepted	1/1	17ms	13260 KiB
		16	Accepted	1/1	17ms	13252 KiB
		17	Accepted	1/1	19ms	13836 KiB
		18	Accepted	1/1	18ms	13768 KiB
		19	Accepted	2/2	18ms	14060 KiB
		20	Accepted	2/2	18ms	14124 KiB
		21	Accepted	3/3	26ms	14948 KiB
		22	Accepted	3/3	34ms	16684 KiB
		23	Accepted	4/4	65ms	26144 KiB
		24	Accepted	4/4	64ms	25132 KiB
		25	Accepted	4/4	120ms	36836 KiB
		26	Accepted	4/4	119ms	36360 KiB
		27	Time limit exceeded	0/4	207ms	43712 KiB
		28	Time limit exceeded	0/4	203ms	43820 KiB