View Code of Problem 61

#include <stdio.h>
#include <stdlib.h>
#include<ctype.h>
#include<string.h>
#include<math.h>
#include<stdbool.h>
int main()
{
	int i, j, k, t, n;
	int max, min;
	int a[100] = { 0 };
	int b[100] = { 0 };
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		for (i = 0; i < n; i++)
			scanf("%d", &a[i]);
		int temp;
		for (i = 0; i < n; i++)
		{
			min = i;
			for (j = i + 1; j < n; j++)
			{
				if (a[min] > a[i])
					min = i;
			}
			temp = a[i];
			a[i] = a[min];
			a[min] = temp;
		}
		
		max = a[n-1];
		for (i = 0; i < n; i++)
		{
			if (max < a[i] * (n - i))
				max = a[i] * (n - i);
		}
		printf("%d\n", max);
	}
	
	return 0;
}