-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathZCO1.cpp
More file actions
68 lines (68 loc) · 855 Bytes
/
ZCO1.cpp
File metadata and controls
68 lines (68 loc) · 855 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<iostream>
using namespace std;
int ab[500001]; long long int ac[500001];
void merge(int aa[], int min, int mid,int max)
{
int tmp[500001],i,j,k,m;
j=min;
m=mid+1;
for(i=min;j<=mid&&m<=max;i++)
{
if(aa[j]<=aa[m])
{
tmp[i]=aa[j];
j++;
}
else
{
tmp[i]=aa[m];
m++;
}
}
if(j>mid)
{
for(k=m;k<=max;k++)
{
tmp[i]=aa[k];
i++;
}
}
else
{
for(k=j;k<=mid;k++)
{
tmp[i]=aa[k];
i++;
}
}
for(k=min;k<=max;k++)
aa[k]=tmp[k];
}
void mergesort(int aa[], int a, int b)
{
int mid;
if(a<b)
{
mid=(a+b)/2;
mergesort(aa,a,mid);
mergesort(aa,mid+1,b);
merge(aa,a,mid,b);
}
}
int main()
{
long long int n;
cin>>n;
long long int ll=0;
for(int i=0;i<n;i++)
cin>>ab[i];
mergesort(ab,0,n-1);
for(int i=0;i<n;i++)
{
ac[i]=ab[i]*(n-i);
if(ll<ac[i])
ll = ac[i];
}
cout<<ll<<endl;
return 0;
}