Submission #9,844

2024-03-11 14:55:23

python3

Accepted 50/50

197ms

43152 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=1
    mcount=1
    res=0
    i=j=0
    for _ in range(n+m-2):
        if N[i]>M[j]:
            res+=N[i]*mcount
            i+=1
            ncount+=1
        else:
            res+=M[j]*ncount
            j+=1
            mcount+=1
    print(res)

solv()

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	11288 KiB
		2	Accepted	0/0	112ms	34240 KiB
		3	Accepted	1/1	17ms	11500 KiB
		4	Accepted	1/1	17ms	11840 KiB
		5	Accepted	1/1	18ms	12188 KiB
		6	Accepted	1/1	18ms	11952 KiB
		7	Accepted	1/1	18ms	12628 KiB
		8	Accepted	1/1	17ms	12864 KiB
		9	Accepted	1/1	17ms	12656 KiB
		10	Accepted	1/1	18ms	12940 KiB
		11	Accepted	1/1	18ms	12896 KiB
		12	Accepted	1/1	17ms	12844 KiB
		13	Accepted	1/1	17ms	12792 KiB
		14	Accepted	1/1	18ms	13024 KiB
		15	Accepted	1/1	18ms	13124 KiB
		16	Accepted	1/1	17ms	13180 KiB
		17	Accepted	1/1	18ms	13292 KiB
		18	Accepted	1/1	18ms	13180 KiB
		19	Accepted	2/2	18ms	13548 KiB
		20	Accepted	2/2	18ms	13392 KiB
		21	Accepted	3/3	25ms	14588 KiB
		22	Accepted	3/3	32ms	16012 KiB
		23	Accepted	4/4	64ms	25328 KiB
		24	Accepted	4/4	65ms	24632 KiB
		25	Accepted	4/4	118ms	37528 KiB
		26	Accepted	4/4	112ms	35980 KiB
		27	Accepted	4/4	192ms	42936 KiB
		28	Accepted	4/4	197ms	43152 KiB