View Code of Problem 61

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	//freopen("61.txt","r",stdin);
	int t,n;
	scanf("%d",&t);
	for(int i=0;i<t;i++){
		int max=0,num=0,j;
		scanf("%d",&n);
		vector<int> vt(n);
		for(j=0;j<n;j++){
			scanf("%d",&vt[j]);
		}
		sort(vt.begin(),vt.end(),cmp);
		for(j=0;j<n;j++){
			num++;
			if(vt[j]*num>max){
				max=vt[j]*num;
			}
		}
		printf("%d\n",max);
	}
	return 0;
}