Help me in solving SESO03 problem

My issue

what does failed hidden test case mean

My code

#include <stdio.h>

int main() {
	int n, k;
	scanf("%d %d", &n, &k); 
	int arr[n];
	for (int i = 0; i< n; i++) {
	    scanf("%d", &arr[i]);
	    
	}
    int found = 0;
    for (int i = 0; i < n; i++){
        if (arr[i == k]){
            found  = 1;
            break;
        }
    }
    if (found){
        printf("YES\n");
        }else{
            printf("NO\n");
        
        }
    return 0;
}


Learning course: Data structures & Algorithms lab
Problem Link: https://www.codechef.com/learn/course/muj-aiml-dsa-c/MUJADSAC10/problems/SESO03