Codechef ZCO14003 Solution

ZCO14003.cpp

// Garvit Sharma <garvits45@gmail.com> <garvitlnmiit> <garvitsharma.in>
// Codechef ZCO, problem 1

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

const int MAX_SIZE = 500000;
typedef long long ll;
ll data[MAX_SIZE];

int main() {
  int n;
  ll maxProfit=0;
  scanf("%d",&n);
  for(int i=0; i<n; i++) {
    scanf("%lld",data+i);
  }
  sort(data, data+n);

  for(int i=0; i<n; i++) {
    maxProfit=max(maxProfit, (n-i)*data[i]);
  }

  cout << maxProfit << endl;

  return 0;
}