Replace for X

You are given an array of $N$ integers $ A_1, A_2,\dots,A_N$ and three more integers $X, p,$ and $k$. An operation on the array is defined to be: replace the $k$-th smallest integer in the array with any integer you want. Output the minimum number of operations you must perform on the array (possibly $0$ operations) to make the $p$-th smallest element of the array equal to $X$. If it is im