View Code of Problem 61

#include<iostream>
#include<vector>
using namespace std;
int reMax(vector <int>lv) {
	int re=0;
	for (int i = 0; i < lv.size(); i++)//主循环
	{
		int num=0;
		for (int j = 0; j < lv.size(); j++)//判断大于他的数的数量;
		{
			if (lv[i] <= lv[j]) {
				num++;
			}
		}
		if (re < num * lv[i]) {
			re=num * lv[i];
		}
	}
	return re;
	
}
int main() {
	int t;
	cin >> t;
	while (t--) {
		int n;//绳子数量
		cin >> n;
		vector <int>lv;
		while(n--){
			int a;
			cin>>  a;
			lv.push_back(a);
		}
		int max = reMax(lv);
		cout << max;
		if (t != 0)cout << endl;
	}
}