View Code of Problem 61

#include<iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;

int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int m=0,max=0,j;
		scanf("%d",&m);
		vector<int> a(m);
		for(int i=0;i<m;i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a.begin(),a.end(),greater<int>());
		max=a[0];
		for(j=1;j<n;j++)
		{
			if(a[j]*(j+1)>max)     
			{
				max=a[j]*(j+1);
			}
		}
		printf("%d\n",max);
	}
	system("pause");
	return 0;
}

Double click to view unformatted code.


Back to problem 61