WA in IITKWPCO

[abhishek_g]

This is my code

# include <stdio.h>
# include <stdlib.h>
# define MAX 1024
int comp (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}
int main (void)
{
	int i, j, n, t;
	long long arr[MAX], count;
    scanf ("%d", &t);

while (t--)
{
	scanf ("%d", &n);

	for (i = 0; i < n; i++)
		scanf ("%lld", &arr[i]);

	count = 0;

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

	for (i = 0; i < n; i++)
	{	
		if (arr[i] == -1)
			continue;

		for (j = 0; j < n; j++)
		{
			//flag = 0 ;

			if (2*arr[i] == arr[j])
			{
				count++;
				arr[i] = -1;
				arr[j] = -1;
				break;
			}	
		}

	}

	printf ("%lld\n", count);
}

return 0;
}

Where I am going wrong ?

[leppyr64]

you are using sizeof(int) in your qsort to sort an array of long long. Why are you using long long in the first place?