AtCoder Beginner Contest 081
翻译中…
Problem Statement
翻译中…
Takahashi has $N$ balls. Initially, an integer $A_i$ is written on the $i$-th ball.
翻译中…
He would like to rewrite the integer on some balls so that there are at most $K$ different integers written on the $N$ balls.
翻译中…
Find the minimum number of balls that Takahashi needs to rewrite the integers on them.
翻译中…
Constraints
翻译中…
$1 \leq K \leq N \leq 200000$$1 \leq A_i \leq N$- All input values are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N K
A_1 A_2 ... A_N翻译中…
Output
翻译中…
Print the minimum number of balls that Takahashi needs to rewrite the integers on them.
翻译中…
样例
Input #1
5 2
1 1 2 2 5
Output #1
1
For example, if we rewrite the integer on the fifth ball to $2$, there are two different integers written on the balls: $1$ and $2$. 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 $1$.
Input #2
4 4
1 1 2 2
Output #2
0
Already in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.
Input #3
10 3
5 1 3 2 4 1 1 2 3 4
Output #3
3
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。