View Code of Problem 61

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<algorithm>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n],b[n],max=0;
        for(int i=0;i<n;i++)
            { cin>>a[i]; b[i]=a[i]; }
        sort(a,a+n);sort(b,b+n);
        for(int i=0;i<n;i++)
        {
            int temp=a[i]*(n-i);
            if(temp>max)
                max=temp;
        }
        cout<<max<<endl;
    }
}