#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
long long ans = 0;
for (int i = 1; i < n; i++)
ans += (a[i] + a[0]);
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
11 ms |
1220 KB |
Output is correct |
3 |
Correct |
32 ms |
2032 KB |
Output is correct |
4 |
Correct |
33 ms |
1868 KB |
Output is correct |
5 |
Correct |
29 ms |
1944 KB |
Output is correct |
6 |
Correct |
31 ms |
1816 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 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 |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
11 ms |
1220 KB |
Output is correct |
3 |
Correct |
32 ms |
2032 KB |
Output is correct |
4 |
Correct |
33 ms |
1868 KB |
Output is correct |
5 |
Correct |
29 ms |
1944 KB |
Output is correct |
6 |
Correct |
31 ms |
1816 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
11 ms |
1204 KB |
Output is correct |
22 |
Correct |
32 ms |
2044 KB |
Output is correct |
23 |
Correct |
28 ms |
1980 KB |
Output is correct |
24 |
Correct |
32 ms |
1892 KB |
Output is correct |
25 |
Correct |
34 ms |
1936 KB |
Output is correct |
26 |
Correct |
31 ms |
1876 KB |
Output is correct |
27 |
Correct |
38 ms |
2004 KB |
Output is correct |
28 |
Correct |
30 ms |
1868 KB |
Output is correct |
29 |
Correct |
33 ms |
1940 KB |
Output is correct |
30 |
Correct |
28 ms |
1900 KB |
Output is correct |