Submission #7648758


Source Code Expand

N, K = map(int, input().split())
array = list(map(int, input().split()))
dic = {}
ans = 0
for item in array:
    if item in dic:
        dic[item] += 1
    else:
        dic[item] = 1
dic_sorted = sorted(dic.items(), key=lambda x:x[1])
count = len(dic)
i = 0
while K < count:
    count -= 1
    ans += dic_sorted[i][1]
    i += 1
print(ans)

Submission Info

Submission Time
Task C - Not so Diverse
User itsumiryu
Language Python (3.4.3)
Score 300
Code Size 358 Byte
Status AC
Exec Time 231 ms
Memory 38964 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 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 AC 17 ms 3064 KB
10.txt AC 114 ms 24460 KB
11.txt AC 113 ms 23556 KB
12.txt AC 231 ms 38964 KB
13.txt AC 106 ms 21872 KB
2.txt AC 18 ms 3064 KB
3.txt AC 113 ms 24744 KB
4.txt AC 116 ms 24852 KB
5.txt AC 117 ms 23908 KB
6.txt AC 107 ms 21452 KB
7.txt AC 102 ms 24100 KB
8.txt AC 110 ms 24996 KB
9.txt AC 128 ms 24400 KB
sample1.txt AC 18 ms 3060 KB
sample2.txt AC 18 ms 3064 KB
sample3.txt AC 17 ms 3060 KB