View Code of Problem 61

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