View Code of Problem 61

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