ZCO14003
Problem Code: ZCO14003
Smart Phone
how it can be solved ?
ZCO14003
how it can be solved ?
Follow these steps to solve the problem.
Pseudo Code:
n = readInt();
a[] = readArray();
sort(a);
ans = 0;
for(i=0;i<n;i++) {
currentCost = (a[i] * (n-i));
ans = max(ans, currentCost);
}
return ans;
Note: YOU MUST TAKE CARE OF BOUNDS. YOU MIGHT WANT TO USE LONG OR LARGER DATA TYPES (by larger I mean which can store bigger values, say 10^{18}) FOR THIS PROBLEM, IT WAS MENTIONED TOO.
Thank you so much.