View Code of Problem 61

#include<iostream>
#include<string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include<cstring>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		vector<int>a;
		int n;
		cin >> n;
		while (n--)
		{
			int z;
			cin >> z;
			a.push_back(z);
		}
		sort(a.begin(), a.end());
		int max = 0;
		for (int i = 0;i < a.size();i++)
		{
			int k = (a.size() - i)*a[i];
			if (k > max)
				max = k;
		}
		cout << max << endl;
	}
}