I am working on an exercise "k largest elements" from geeksforgeeks.org

<https://practice.geeksforgeeks.org/problems/k-largest-elements/0>

**The task:**

Given an array of N positive integers, print k largest elements from the array. The output elements should be printed in decreasing order.

**Input:**

The first line of input contains an integer T denoting the number of test cases. The first line of each test case is N and k, N is the size of array and K is the largest elements to be returned. The second line of each test case contains N input C[i].

**Output:**

Print the k largest element in descending order.

**Constraints:**

1 ≤ T ≤ 100 

1 ≤ N ≤ 100 (actually 1000 as someone identified) 

K ≤ N

1 ≤ C[i] ≤ 1000\*

**Example:**

Input:

```
2
5 2
12 5 787 1 23
7 3
1 23 12 9 30 2 50

```

Output:

```
787 23
50 30 23

```

**Explanation:**

Testcase 1: 1st largest element in the array is 787 and second largest is 23.

Testcase 2: 3 Largest element in the array are 50, 30 and 23.

I have constructed a solution, which works with the initial test case, but later throws a segmentation fault. I cannot understand where could I get the segmentation fault:

```
Runtime Error:
Segmentation Fault (SIGSEGV)

```

[Runtime Error](https://i.stack.imgur.com/L1veY.png)

The problem with these exercises is that I do not know the input data to the test case, which generates the error. Bellow you will find my code, which is rather simple. Perhaps you can help me to identify what could cause the segmentation fault.

```
#include <stdio.h>

static int Arr[1024], Res[1024];

int main()
{
    int t=0;
    scanf("%d", &t);

    while(t--)
    {
        int n=0,k=0, i=0,j=0,z=0;
        scanf("%d %d", &n, &k);

       // if(n>1000)
       //     printf("Gotya");

        for(i=0; i<n; i++)
        {
            scanf("%d", &Arr[i]);
        }

        i=0;

        int max_l = 0, max_h = 1000, j_max = 0;

        for(i=0; i<k; i++)
        {

            for(j=0; j<n; j++)
            {
                if(Arr[j] >= max_l)
                {
                    max_l = Arr[j];
                    j_max = j;
                }
            }
            Res[i]= max_l;
            max_l = 0;
            Arr[j_max] = 0;
            j_max = 0;
        }

        for(z=0; z<k; z++)
        {
            printf("%d ", Res[z]);
        }

        printf("\n");

    }
    return 0;
}

```