Submission #10,976

2024-04-25 14:56:44

python3

Accepted 50/50

108ms

43968 KiB

M,N = map(int,input().split())
sor = list(map(int,input().split()))
oszlop = list(map(int,input().split()))
rang_sor = [0] * 10001
rang_oszlop = [0] * 10001
for x in sor:
    rang_sor[x] += 1
for x in oszlop:
    rang_oszlop[x] += 1
v_vagas = 0
f_vagas = 0
koltseg = 0
for i in range(10000,0,-1):
    if rang_sor[i] > 0:
        koltseg += i * rang_sor[i] * (v_vagas+1)
        f_vagas += rang_sor[i]
        #print("V",i,koltseg)
    if rang_oszlop[i] > 0:
        koltseg += i * rang_oszlop[i] * (f_vagas+1)
        v_vagas += rang_oszlop[i]
        #print("F",i,koltseg)
print(koltseg)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	20ms	11396 KiB
		2	Accepted	0/0	76ms	34044 KiB
		3	Accepted	1/1	20ms	11920 KiB
		4	Accepted	1/1	19ms	11824 KiB
		5	Accepted	1/1	19ms	12180 KiB
		6	Accepted	1/1	19ms	11912 KiB
		7	Accepted	1/1	19ms	12420 KiB
		8	Accepted	1/1	20ms	12764 KiB
		9	Accepted	1/1	20ms	12844 KiB
		10	Accepted	1/1	20ms	13048 KiB
		11	Accepted	1/1	20ms	13076 KiB
		12	Accepted	1/1	20ms	13092 KiB
		13	Accepted	1/1	19ms	13012 KiB
		14	Accepted	1/1	20ms	13340 KiB
		15	Accepted	1/1	20ms	13528 KiB
		16	Accepted	1/1	20ms	13360 KiB
		17	Accepted	1/1	20ms	13852 KiB
		18	Accepted	1/1	20ms	13612 KiB
		19	Accepted	2/2	21ms	13732 KiB
		20	Accepted	2/2	20ms	13732 KiB
		21	Accepted	3/3	29ms	15040 KiB
		22	Accepted	3/3	34ms	16448 KiB
		23	Accepted	4/4	48ms	25580 KiB
		24	Accepted	4/4	48ms	24512 KiB
		25	Accepted	4/4	72ms	37876 KiB
		26	Accepted	4/4	72ms	36048 KiB
		27	Accepted	4/4	108ms	43912 KiB
		28	Accepted	4/4	108ms	43968 KiB