Minimum Distinct

You are given an array of $N$ integers. You can perform the following operation at most $K$ times: - Choose $2$ indices $i$ and $j$ such that $1 \le i < j \le N$ - Set the value of $A_j$ to $A_i$. Find the minimum number of distinct elements that could be left in $A$ after performing at most $K$ operations. ### Input - The first line of input will contain a single integer $T$, denoting the nu