Find Multiset State

You are given an array $A$ of length $N$, along with an integer $K$. It is known that $A$ is sorted in non-descending order, that is, $A_i \leq A_{i+1}$ for every $1 \leq i \lt N$. Repeat the following three-step operation $K$ times: 1. First, find $\min(A) = X$ and $\max(A) = Y$, i.e. the minimum and maximum elements in the array. 2. Delete $X$ and $Y$ from $A$ (if there exists multiple occur