View Code of Problem 61

#include <stdio.h>
int main(){
  int t;
  int n;
  int a[1000];
  int k=0;
  int v=0;
  int max[1000];
  int smax;
  int i,j,p,q,temp;
  scanf("%d",&t);
  for(i=0;i<t;i++){
    scanf("%d",&n);
	k=0,v=0;
    for(j=0;j<n;j++){
      scanf("%d",&a[k++]);
    
    }
    for(p=0;p<k;p++){
      for(q=p+1;q<k;q++){
        if(a[p]>a[q]){
          temp = a[p];
          a[p] = a[q];
          a[q] = temp;
        }
      }
    
    }
	
    for(k=0,j=n;j>0;j--,k++){
      max[v++]=a[k]*j;
      
    }
	
    smax = max[0];
    for(j=1;j<v;j++){
      if(max[j]>smax){
        smax = max[j];
      }
    }
    printf("%d\n",smax);
  
  
  }
 
 
 
return 0;
}

Double click to view unformatted code.


Back to problem 61