#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, arr[N];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++) cin >> arr[i];
sort(arr + 1, arr + n + 1);
cout << accumulate(arr + 2, arr + n + 1, 0ll) + (n - 1) * arr[1];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Output is correct |
2 |
Correct |
6 ms |
1236 KB |
Output is correct |
3 |
Correct |
13 ms |
1996 KB |
Output is correct |
4 |
Correct |
10 ms |
1880 KB |
Output is correct |
5 |
Correct |
10 ms |
1956 KB |
Output is correct |
6 |
Correct |
10 ms |
1752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
344 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 |
1 ms |
352 KB |
Output is correct |
2 |
Correct |
6 ms |
1236 KB |
Output is correct |
3 |
Correct |
13 ms |
1996 KB |
Output is correct |
4 |
Correct |
10 ms |
1880 KB |
Output is correct |
5 |
Correct |
10 ms |
1956 KB |
Output is correct |
6 |
Correct |
10 ms |
1752 KB |
Output is correct |
7 |
Correct |
1 ms |
352 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
344 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 |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
6 ms |
1244 KB |
Output is correct |
22 |
Correct |
18 ms |
2028 KB |
Output is correct |
23 |
Correct |
12 ms |
2008 KB |
Output is correct |
24 |
Correct |
17 ms |
1876 KB |
Output is correct |
25 |
Correct |
17 ms |
1992 KB |
Output is correct |
26 |
Correct |
17 ms |
1808 KB |
Output is correct |
27 |
Correct |
17 ms |
1980 KB |
Output is correct |
28 |
Correct |
15 ms |
1796 KB |
Output is correct |
29 |
Correct |
16 ms |
2004 KB |
Output is correct |
30 |
Correct |
14 ms |
2012 KB |
Output is correct |