#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int nums; cin >> nums;
ll minlen = LLONG_MAX, sum = 0;
for (int i = 0; i < nums; i++) {
ll x; cin >> x;
minlen = min(minlen, x);
sum += x;
}
sum -= minlen;
cout << minlen * (nums - 1) + sum;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
5 ms |
312 KB |
Output is correct |
3 |
Correct |
11 ms |
308 KB |
Output is correct |
4 |
Correct |
9 ms |
204 KB |
Output is correct |
5 |
Correct |
9 ms |
204 KB |
Output is correct |
6 |
Correct |
7 ms |
308 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
0 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 |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
5 ms |
312 KB |
Output is correct |
3 |
Correct |
11 ms |
308 KB |
Output is correct |
4 |
Correct |
9 ms |
204 KB |
Output is correct |
5 |
Correct |
9 ms |
204 KB |
Output is correct |
6 |
Correct |
7 ms |
308 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 |
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 |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
4 ms |
204 KB |
Output is correct |
22 |
Correct |
12 ms |
204 KB |
Output is correct |
23 |
Correct |
9 ms |
204 KB |
Output is correct |
24 |
Correct |
8 ms |
204 KB |
Output is correct |
25 |
Correct |
10 ms |
204 KB |
Output is correct |
26 |
Correct |
8 ms |
204 KB |
Output is correct |
27 |
Correct |
9 ms |
204 KB |
Output is correct |
28 |
Correct |
8 ms |
204 KB |
Output is correct |
29 |
Correct |
9 ms |
204 KB |
Output is correct |
30 |
Correct |
10 ms |
204 KB |
Output is correct |