View Code of Problem 61

#include<iostream>
#include<algorithm>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<cstring>;
#include<string>
using namespace std;
int main() {
    int t,n,max=0;
	cin>>t;
	while(t--)
	{
		cin>>n;
		int a[n];
		memset(a,0,sizeof(a));
		for(int i=0;i<n;i++)
		{
			cin>>a[i];
			
		}
		sort(a,a+n);
		for(int i=n-1;i>=0;i--)
		{
			if(i==n-1)
			max=a[i];
			else
			{
				if(a[i]*(n-i)>max)
				{
					max=a[i]*(n-i);
				}
			}
		
		}
			cout<<max<<endl;
	 } 
	return 0;
}