Submission #9,837

2024-03-11 14:20:43

python3

Time limit exceeded 42/50

218ms

44480 KiB

def solv():
    n,m=[int(x) for x in input().split()]
    N=[int(xx) for xx in input().split()]
    M=[int(xx) for xx 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	17ms	11344 KiB
		2	Accepted	0/0	122ms	34252 KiB
		3	Accepted	1/1	17ms	11400 KiB
		4	Accepted	1/1	18ms	12068 KiB
		5	Accepted	1/1	18ms	12132 KiB
		6	Accepted	1/1	18ms	12140 KiB
		7	Accepted	1/1	18ms	12672 KiB
		8	Accepted	1/1	17ms	12968 KiB
		9	Accepted	1/1	17ms	12884 KiB
		10	Accepted	1/1	17ms	12704 KiB
		11	Accepted	1/1	17ms	12656 KiB
		12	Accepted	1/1	18ms	12748 KiB
		13	Accepted	1/1	17ms	12624 KiB
		14	Accepted	1/1	19ms	13240 KiB
		15	Accepted	1/1	18ms	13192 KiB
		16	Accepted	1/1	18ms	13180 KiB
		17	Accepted	1/1	19ms	13652 KiB
		18	Accepted	1/1	19ms	13692 KiB
		19	Accepted	2/2	19ms	13884 KiB
		20	Accepted	2/2	19ms	13764 KiB
		21	Accepted	3/3	27ms	15148 KiB
		22	Accepted	3/3	35ms	16704 KiB
		23	Accepted	4/4	70ms	26172 KiB
		24	Accepted	4/4	71ms	25184 KiB
		25	Accepted	4/4	128ms	38160 KiB
		26	Accepted	4/4	127ms	36616 KiB
		27	Time limit exceeded	0/4	218ms	44276 KiB
		28	Time limit exceeded	0/4	214ms	44480 KiB