#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e5;
int n, a[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i)
cin >> a[i];
cout << accumulate(a, a+n, 0ll)+(ll)(n-2)**min_element(a, a+n);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
5 ms |
588 KB |
Output is correct |
3 |
Correct |
11 ms |
588 KB |
Output is correct |
4 |
Correct |
8 ms |
664 KB |
Output is correct |
5 |
Correct |
9 ms |
588 KB |
Output is correct |
6 |
Correct |
8 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
5 ms |
588 KB |
Output is correct |
3 |
Correct |
11 ms |
588 KB |
Output is correct |
4 |
Correct |
8 ms |
664 KB |
Output is correct |
5 |
Correct |
9 ms |
588 KB |
Output is correct |
6 |
Correct |
8 ms |
632 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
0 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
0 ms |
204 KB |
Output is correct |
21 |
Correct |
6 ms |
588 KB |
Output is correct |
22 |
Correct |
12 ms |
656 KB |
Output is correct |
23 |
Correct |
9 ms |
716 KB |
Output is correct |
24 |
Correct |
8 ms |
588 KB |
Output is correct |
25 |
Correct |
9 ms |
616 KB |
Output is correct |
26 |
Correct |
11 ms |
568 KB |
Output is correct |
27 |
Correct |
9 ms |
692 KB |
Output is correct |
28 |
Correct |
8 ms |
588 KB |
Output is correct |
29 |
Correct |
9 ms |
588 KB |
Output is correct |
30 |
Correct |
11 ms |
560 KB |
Output is correct |