Submission #3779727

Source Code Expand

from collections import Counter
N=int(input())
A=list(map(int,input().split()))
Ca=dict(Counter(A))
Dk=Ca.keys()
a=0
for i in Dk:
    if i>Ca[i]:
        a+=Ca[i]
    elif i<Ca[i]:
        a+=Ca[i]-i
print(a)

Submission Info

Submission Time
Task C - Good Sequence
User moro
Language Python (3.4.3)
Score 300
Code Size 219 Byte
Status AC
Exec Time 89 ms
Memory 21740 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 20 ms 3316 KB
0_01.txt AC 20 ms 3316 KB
0_02.txt AC 20 ms 3316 KB
0_03.txt AC 21 ms 3316 KB
0_04.txt AC 21 ms 3316 KB
1_00.txt AC 21 ms 3316 KB
1_01.txt AC 20 ms 3316 KB
1_02.txt AC 40 ms 5044 KB
1_03.txt AC 51 ms 14216 KB
1_04.txt AC 52 ms 14316 KB
1_05.txt AC 52 ms 14312 KB
1_06.txt AC 54 ms 14408 KB
1_07.txt AC 52 ms 14780 KB
1_08.txt AC 59 ms 14300 KB
1_09.txt AC 68 ms 15140 KB
1_10.txt AC 75 ms 15128 KB
1_11.txt AC 85 ms 18712 KB
1_12.txt AC 89 ms 21740 KB