Submission #55069616

Source Code Expand

from collections import defaultdict

N = int(input())
A = list(map(int, input().split()))
W = list(map(int, input().split()))


box = defaultdict(list)
for i in range(N):
    a = A[i]
    w = W[i]
    box[a].append(w)

ans = 0
for k, v in box.items():
    if len(v) > 1:
        # print(v)
        ans += sum(sorted(v)[:-1])
print(ans)

Submission Info

Submission Time
Task C - Move It
User mu16
Language Python (PyPy 3.10-v7.3.12)
Score 250
Code Size 355 Byte
Status AC
Exec Time 117 ms
Memory 113232 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 250 / 250
Status
AC × 2
AC × 23
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 02_corner_00.txt, 02_corner_01.txt, 02_corner_02.txt, 02_corner_03.txt, 02_corner_04.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 67 ms 76788 KiB
00_sample_01.txt AC 67 ms 76992 KiB
01_random_00.txt AC 115 ms 112992 KiB
01_random_01.txt AC 93 ms 93092 KiB
01_random_02.txt AC 116 ms 113144 KiB
01_random_03.txt AC 109 ms 110592 KiB
01_random_04.txt AC 114 ms 113108 KiB
01_random_05.txt AC 90 ms 92740 KiB
01_random_06.txt AC 115 ms 113000 KiB
01_random_07.txt AC 109 ms 109296 KiB
01_random_08.txt AC 115 ms 112988 KiB
01_random_09.txt AC 114 ms 112480 KiB
01_random_10.txt AC 113 ms 113232 KiB
01_random_11.txt AC 91 ms 90540 KiB
01_random_12.txt AC 114 ms 113028 KiB
01_random_13.txt AC 109 ms 110956 KiB
01_random_14.txt AC 117 ms 113012 KiB
01_random_15.txt AC 107 ms 107848 KiB
02_corner_00.txt AC 85 ms 96444 KiB
02_corner_01.txt AC 100 ms 112316 KiB
02_corner_02.txt AC 102 ms 105648 KiB
02_corner_03.txt AC 100 ms 105264 KiB
02_corner_04.txt AC 101 ms 105108 KiB