Submission #3421465


Source Code Expand

N = int(input())
l = list(map(int, input().split()))
unique_l = list(set(l))
unique_l.sort()
l.sort()
l.append(0)
ans = 0
j = 0
cnt =[]
for i in unique_l:
    temp = 0
    while l[j] == i and j < N:
        temp += 1
        j += 1
    cnt.append(temp)
for i, j in zip(unique_l, cnt):
    if i == j:
        pass
    elif j > i:
        ans += j - i
    elif j < i:
        ans += j
print(ans)

Submission Info

Submission Time
Task C - Good Sequence
User satoshi_f
Language Python (3.4.3)
Score 300
Code Size 415 Byte
Status AC
Exec Time 197 ms
Memory 14492 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 5
AC × 18
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt
Case Name Status Exec Time Memory
0_00.txt AC 17 ms 3060 KB
0_01.txt AC 17 ms 3064 KB
0_02.txt AC 17 ms 3064 KB
0_03.txt AC 17 ms 3064 KB
0_04.txt AC 17 ms 3064 KB
1_00.txt AC 17 ms 3064 KB
1_01.txt AC 17 ms 3064 KB
1_02.txt AC 61 ms 4660 KB
1_03.txt AC 69 ms 13964 KB
1_04.txt AC 72 ms 14492 KB
1_05.txt AC 69 ms 13936 KB
1_06.txt AC 73 ms 14020 KB
1_07.txt AC 76 ms 14268 KB
1_08.txt AC 103 ms 13920 KB
1_09.txt AC 129 ms 14244 KB
1_10.txt AC 151 ms 13596 KB
1_11.txt AC 177 ms 13920 KB
1_12.txt AC 197 ms 13948 KB