[Solution] K-MEX CodeChef Solution | CodeChef Solution

[Solution] K-MEX CodeChef Solution | CodeChef Solution

You are given an array A$A$ containing N$N$ integers. Find if it is possible to choose exactly M$M$ elements from the array such that the MEX of the chosen elements is exactly K$K$.

Recall that the MEX of an array is the smallest non-negative integer that does not belong to the array. For example, the MEX of [2,2,1]$[2,2,1]$ is 0$0$ because 0$0$ does not belong to the array, the MEX of [3,1,0,1]$[3,1,0,1]$ is 2$2$ because 0$0$ and 1$1$ belong to the array, but 2$2$ does not.

Input Format

• The first line contains an integer T$T$, denoting the number of test cases. The T$T$ test cases then follow:

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• The first line of each test case contains an integer N,M,K$N,M,K$, denoting the length of the array, the number of elements to be chosen, and the required MEX respectively.
• The second line of each test case contains N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$, denoting

Enough Space CodeChef Solution

Chef Drinks Tea CodeChef Solution

High Accuracy CodeChef Solution

K-MEX CodeChef Solution

Xor Permutation CodeChef Solution

Permutation And Median CodeChef Solution

Segmentation Fault CodeChef Solution

•  the elements of the array.

Output Format

For each test case, print YES if it is possible to choose M$M$ elements from the array A$A$ so that the MEX of the chosen elements is exactly K$K$ and NO otherwise.

You may print each character of the string in uppercase or lowercase (for example, the strings yEs, yes, Yes and YES will all be treated as identical).

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤N≤100$1\le N\le 100$
• 1≤M≤N$1\le M\le N$