View Code of Problem 61

#include<stdio.h>
#include<math.h>
#include<string.h>

int main()
{
    int te;
    scanf("%d",&te);
    while(te--)
    {
        int n,i,j,t;
        scanf("%d",&n);
        int a[n];
        for(i = 0;i < n;i++)
            scanf("%d",&a[i]);
        for(i = 0;i < n-1;i++)
        {

            for(j = i+1;j < n;j++)
            {
                if(a[j] > a[i])
                {
                    t = a[j];
                    a[j] = a[i];
                    a[i] = t;
                }
            }

        }

        int mmax = 0;
        for(i = 0;i < n;i++)
        {
            if((i+1)*a[i] > mmax)
                mmax = (i+1)*a[i];
        }
        printf("%d\n",mmax);

    }
    return 0;
}