木桶原理.
对载重进行从小大大排序,然后枚举就可以了.
#include <iostream>
#include <cstdio>
#include <memory.h>
#include <cmath>
#include <limits.h>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int ropes[maxn], n;
int main(){
int T;
scanf("%d", &T);
while (T--){
scanf("%d", &n);
for (int i = 0; i < n; ++i){
scanf("%d", &ropes[i]);
}
sort(ropes, ropes + n);
int ans = 0;
for (int i = 0; i < n; ++i){
if(ropes[i] * (n - i) > ans){
ans = ropes[i] * (n - i);
}
}
printf("%d\n",ans);
}
return 0;
}