简单水题 POJ 2291 Rotten Ropes

题目传送门

 /*
     我校oj的源题，看懂题意就很水，贴出来省的再敲:)
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 using namespace std;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;
 int a[MAXN];

 int main(void)        //POJ 2291 Rotten Ropes
 {
     int t, n;    scanf ("%d", &t);
     while (t--)
     {
         scanf ("%d", &n);
         for (int i=; i<=n; ++i)    scanf ("%d", &a[i]);
         sort (a+, a++n);
         int ans = ;    int m = n;
         for (int i=; i<=n; ++i)
         {
             ans = max (ans, m * a[i]);
             m--;
         }

         printf ("%d\n", ans);
     }

     return ;
 }