Help me to find the wrong test case in Warrior Chef solution.

general
1

include <stdio.h>

int cmpfunc(const void *a, const void b)
{
return ((int *)a - *(int *)b);
}

int main(int argc, char const *argv)

{
int t;
scanf(“%d”, &t);
while (t–)
{
int n, h;
scanf(“%d %d”, &n, &h);
int arr[n];
for (int i = 0; i < n; i++)
{
scanf(“%d”, &arr[i]);
}

    qsort(arr, n, sizeof(int), cmpfunc);
 

    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        sum = sum + arr[i];
    }
    if (h - sum > 0)
    {
        printf("0\n");
    }
    else
    {
        for (int i = 0; i < n; i++)
        {
            if (h - sum + arr[i] > 0)
            {
                printf("%d\n", arr[i]);
                break;
            }
            sum=sum-arr[i];
        }
    }
}
return 0;

}