View Code of Problem 61

#include <stdio.h>

int Max(int p[],int n){
	int i,temp,j,max=1;
	for (i=0;i<n;i++){
		for (j=i;j<n;j++){
			if (p[i]<p[j]){
				temp=p[i];
				p[i]=p[j];
				p[j]=temp;
			}
		}
	}
	for (i=0;i<n;i++){
		if (max< p[i]*(i+1))
			max=p[i]*(i+1);
	}
	printf("%d\n",max);
	return 0;
}

int main(int argc, char* argv[])
{
	int i,n;
	int a[1000];
	scanf("%d",&n);
	for (i=0;i<n;i++){
		int t;
		scanf("%d",&t);
		for (int j=0;j<t;j++)
			scanf("%d",&a[j]);
		Max(a,t);
	}
	return 0;
}