View Code of Problem 61

#include<stdio.h>

int main() {
	int t, n, s[100], i, j, max;
	scanf("%d", &t);
	while(t--) {
		max = 0;
		scanf("%d", &n);
		for(i=0; i<n; i++)
			scanf("%d", &s[i]);
		int temp;
		for(i=0; i<n; i++){
			for(j=i; j<n; j++) {
				if(s[i] > s[j]) {
					temp = s[i];
					s[i] = s[j];
					s[j] = temp;
				}
			}
		}
		max = s[n-1];
		for(i=1; i<n-1; i++) {
			for(j=0; j<i+1; j++) {
				if(s[j] * (n-i) > max)
					max = s[j] * (n-i);
			}
		}
		printf("%d\n", max);
	}
	return 0;
}