Submission #9,827

2024-03-08 21:18:10

python3

Accepted 50/50

112ms

44704 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	19ms	11544 KiB
		2	Accepted	0/0	78ms	33960 KiB
		3	Accepted	1/1	21ms	11916 KiB
		4	Accepted	1/1	20ms	12448 KiB
		5	Accepted	1/1	20ms	12364 KiB
		6	Accepted	1/1	20ms	12304 KiB
		7	Accepted	1/1	19ms	12340 KiB
		8	Accepted	1/1	20ms	12480 KiB
		9	Accepted	1/1	20ms	12756 KiB
		10	Accepted	1/1	20ms	12692 KiB
		11	Accepted	1/1	20ms	12924 KiB
		12	Accepted	1/1	20ms	13348 KiB
		13	Accepted	1/1	20ms	13272 KiB
		14	Accepted	1/1	20ms	13596 KiB
		15	Accepted	1/1	21ms	13868 KiB
		16	Accepted	1/1	21ms	13872 KiB
		17	Accepted	1/1	21ms	13860 KiB
		18	Accepted	1/1	21ms	14008 KiB
		19	Accepted	2/2	21ms	14020 KiB
		20	Accepted	2/2	21ms	14124 KiB
		21	Accepted	3/3	28ms	15428 KiB
		22	Accepted	3/3	34ms	17032 KiB
		23	Accepted	4/4	50ms	26452 KiB
		24	Accepted	4/4	48ms	25152 KiB
		25	Accepted	4/4	72ms	38620 KiB
		26	Accepted	4/4	75ms	36792 KiB
		27	Accepted	4/4	112ms	44288 KiB
		28	Accepted	4/4	108ms	44704 KiB