#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
long long m=INT_MAX,n,sum,a[1000000];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
m=min(m,a[i]);
}
for(int i=0;i<n;i++){
sum+=(m+a[i]);
}
cout<<sum-2*m;
}
/*
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
annnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnna
an%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%na
an %na
an %na
an %na
an %na
an %na
an %na
an %na
annnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnna
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
1236 KB |
Output is correct |
3 |
Correct |
13 ms |
2012 KB |
Output is correct |
4 |
Correct |
12 ms |
1900 KB |
Output is correct |
5 |
Correct |
11 ms |
2004 KB |
Output is correct |
6 |
Correct |
10 ms |
1788 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
1236 KB |
Output is correct |
3 |
Correct |
13 ms |
2012 KB |
Output is correct |
4 |
Correct |
12 ms |
1900 KB |
Output is correct |
5 |
Correct |
11 ms |
2004 KB |
Output is correct |
6 |
Correct |
10 ms |
1788 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
324 KB |
Output is correct |
21 |
Correct |
5 ms |
1212 KB |
Output is correct |
22 |
Correct |
12 ms |
2048 KB |
Output is correct |
23 |
Correct |
10 ms |
2040 KB |
Output is correct |
24 |
Correct |
10 ms |
1892 KB |
Output is correct |
25 |
Correct |
9 ms |
2004 KB |
Output is correct |
26 |
Correct |
9 ms |
1828 KB |
Output is correct |
27 |
Correct |
10 ms |
2004 KB |
Output is correct |
28 |
Correct |
9 ms |
1876 KB |
Output is correct |
29 |
Correct |
11 ms |
2032 KB |
Output is correct |
30 |
Correct |
12 ms |
2004 KB |
Output is correct |