#include <bits/stdc++.h>
using namespace std;
#define lg long long
int main()
{
lg n;
cin >> n;
vector<lg> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
for(int i = 2; i < n; i++) v[i] += v[i-1];
if(n == 1)
{
cout << "0\n";
return 0;
}
cout << v[n-1]+v[0]*(n-1) << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
11 ms |
1372 KB |
Output is correct |
3 |
Correct |
31 ms |
2132 KB |
Output is correct |
4 |
Correct |
28 ms |
1872 KB |
Output is correct |
5 |
Correct |
29 ms |
2136 KB |
Output is correct |
6 |
Correct |
25 ms |
1884 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
452 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
11 ms |
1372 KB |
Output is correct |
3 |
Correct |
31 ms |
2132 KB |
Output is correct |
4 |
Correct |
28 ms |
1872 KB |
Output is correct |
5 |
Correct |
29 ms |
2136 KB |
Output is correct |
6 |
Correct |
25 ms |
1884 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
452 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
1 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
12 ms |
1372 KB |
Output is correct |
22 |
Correct |
30 ms |
2140 KB |
Output is correct |
23 |
Correct |
36 ms |
2100 KB |
Output is correct |
24 |
Correct |
34 ms |
2048 KB |
Output is correct |
25 |
Correct |
35 ms |
2080 KB |
Output is correct |
26 |
Correct |
31 ms |
1884 KB |
Output is correct |
27 |
Correct |
33 ms |
2132 KB |
Output is correct |
28 |
Correct |
30 ms |
1884 KB |
Output is correct |
29 |
Correct |
33 ms |
1988 KB |
Output is correct |
30 |
Correct |
29 ms |
2032 KB |
Output is correct |