ZCO-2013::SMARTPHONE

#include <bits/stdc++.h>
using namespace std;

int main() {

int n;
cin>>n;
long long int a[n], max=INT16_MIN, temp;
for(int i=0;i<n;++i){
cin>>a[i];
}

sort(a, a+n);

for(int i=0;i<n;++i){
temp = a[i]*(n-i);
if(temp>max)
max=temp;
}

cout<<max;

return 0;
}

Comments

Popular posts from this blog

CodeChef::CSUB

How Recursion Works?

Atcoder Educational Dp contest :: C vacation