View Code of Problem 61

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

Double click to view unformatted code.


Back to problem 61