View Code of Problem 61

#include <stdio.h>

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

int main(void)
{
    int t,n,arr[100000],i,max;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i = 0;i < n;i++)
            scanf("%d",&arr[i]);
        qsort(arr,n,sizeof(arr[0]),comp);
        max = arr[0];
        for(i = 1;i < n;i++)
        {
            if(arr[i] * (i + 1) > max)
                max = arr[i] * (i + 1);
        }
        printf("%d\n",max);
    }
    return 0;
}