#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int main(){ int t; cin>>t; while(t--){ int n,a[999],mul,max=0; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n); for(int i=0;i<n;i++){ mul=a[i]*(n-i); if(mul>max) max=mul; } cout<<max<<endl; } return 0; } |
Double click to view unformatted code.