Submission #9,841

2024-03-11 14:42:06

python3

Time limit exceeded 46/50

204ms

44300 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	46/50
		1	Accepted	0/0	17ms	11004 KiB
		2	Accepted	0/0	115ms	34220 KiB
		3	Accepted	1/1	18ms	11500 KiB
		4	Accepted	1/1	18ms	12072 KiB
		5	Accepted	1/1	17ms	12156 KiB
		6	Accepted	1/1	17ms	12092 KiB
		7	Accepted	1/1	18ms	12504 KiB
		8	Accepted	1/1	18ms	12852 KiB
		9	Accepted	1/1	18ms	13108 KiB
		10	Accepted	1/1	17ms	13104 KiB
		11	Accepted	1/1	18ms	13364 KiB
		12	Accepted	1/1	17ms	13576 KiB
		13	Accepted	1/1	17ms	13272 KiB
		14	Accepted	1/1	18ms	13464 KiB
		15	Accepted	1/1	18ms	13684 KiB
		16	Accepted	1/1	17ms	13596 KiB
		17	Accepted	1/1	19ms	13776 KiB
		18	Accepted	1/1	18ms	13660 KiB
		19	Accepted	2/2	18ms	13936 KiB
		20	Accepted	2/2	19ms	14276 KiB
		21	Accepted	3/3	26ms	15728 KiB
		22	Accepted	3/3	35ms	17156 KiB
		23	Accepted	4/4	67ms	26380 KiB
		24	Accepted	4/4	67ms	25292 KiB
		25	Accepted	4/4	125ms	38376 KiB
		26	Accepted	4/4	116ms	37080 KiB
		27	Accepted	4/4	200ms	44068 KiB
		28	Time limit exceeded	0/4	204ms	44300 KiB