View Code of Problem 61

# include<stdio.h>
int main(void)
{
  int n,i,j,k,t,max,m,a[100];
  scanf("%d",&n);
  for(i=0;i<n;++i)
  {
    scanf("%d",&t);
    for(j=0;j<t;++j)
    {
      scanf("%d",&a[j]);
    }
      for(k=0;k<t-1;++k)
      {
       for(j=0;j<t-1-k;++j)
       {
         if(a[j+1]>a[j])
         {
           m = a[j];
           a[j] = a[j+1];
           a[j+1] = m;
         }
       }
      }
      max = a[0];
      for(j=0;j<t;++j)
      {
        if(max<a[j]*(j+1))
        {
          max = a[j]*(j+1);
        }
      }
      printf("%d\n",max);
  }
  return 0;
}