ACM (TJU) : 1279


#include <cstdio>
#include <algorithm>
using namespace std;

int main ()
{
    int dataset;
    scanf ("%d", &dataset);

    while ( dataset-- ) {
        int n;
        scanf ("%d", &n);

        int a [1005];

        for ( int i = 0; i < n; i++ )
            scanf ("%d", & a [i]);

        sort (a, a + n);

        int max = 0;
        for ( int i = n - 1; i >= 0; i-- ) {
            int temp = a [i] * (n - i);
            if ( temp >= max )
                max = temp;
        }
        printf ("%d\n", max);
    }

    return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s