Submission #1987842


Source Code Expand

N,K = map(int,input().split())
A_list = list(map(int,input().split()))
counter = [0]*(N+1) 
for i in A_list:
    counter[i] += 1
print(counter)
zeronashi = [i for i in counter if i != 0]
zeronashi.sort()
length = len(zeronashi)
x = length - K
y = 0
if x < 1:
    print(0)
else:
    for i in range(x):
        y += zeronashi[i]
    print(y)

Submission Info

Submission Time
Task C - Not so Diverse
User antimatter
Language Python (3.4.3)
Score 0
Code Size 355 Byte
Status WA
Exec Time 142 ms
Memory 24748 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 3
WA × 19
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt WA 17 ms 3064 KB
10.txt WA 104 ms 24580 KB
11.txt WA 104 ms 23556 KB
12.txt WA 142 ms 24744 KB
13.txt WA 97 ms 21872 KB
2.txt WA 18 ms 3064 KB
3.txt WA 105 ms 24744 KB
4.txt WA 104 ms 24740 KB
5.txt WA 101 ms 23044 KB
6.txt WA 96 ms 22040 KB
7.txt WA 94 ms 22368 KB
8.txt WA 102 ms 24748 KB
9.txt WA 108 ms 23380 KB
sample1.txt WA 18 ms 3064 KB
sample2.txt WA 17 ms 3064 KB
sample3.txt WA 17 ms 3064 KB