View Code of Problem 61

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t,n,i,a[1005];
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(i=0;i<n;i++)
		cin>>a[i];
		sort(a,a+n);
		int max=0;
		for(i=0;i<n;i++)
		{
		if(a[i]*(n-i)>max)
		{
			max=a[i]*(n-i);
		}
		 } 
		 cout<<max<<endl;	 
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 61