View Code of Problem 61

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