Submission #1986046

---

Source Code Expand

import numpy as np
N, K = map(int, input().split())
a = list(map(int, input().split()))
a = np.array(a)

def solve():
    u, c = np.unique(a, return_counts=True)
    k = len(u) - K
    if len(u) > K:
        print(np.sum(np.sort(c)[:k]))
    else:
        print(0)

solve()

Submission Info

Judge Result