atcoder#ARC086A. [ABC081C] Not so Diverse

[ABC081C] Not so Diverse

Score : 300300 points

Problem Statement

Takahashi has NN balls. Initially, an integer AiA_i is written on the ii-th ball.

He would like to rewrite the integer on some balls so that there are at most KK different integers written on the NN balls.

Find the minimum number of balls that Takahashi needs to rewrite the integers on them.

Constraints

  • 1KN2000001 \leq K \leq N \leq 200000
  • 1AiN1 \leq A_i \leq N
  • All input values are integers.

Input

Input is given from Standard Input in the following format:

NN KK

A1A_1 A2A_2 ... ANA_N

Output

Print the minimum number of balls that Takahashi needs to rewrite the integers on them.

5 2
1 1 2 2 5
1

For example, if we rewrite the integer on the fifth ball to 22, there are two different integers written on the balls: 11 and 22. On the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 11.

4 4
1 1 2 2
0

Already in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.

10 3
5 1 3 2 4 1 1 2 3 4
3