#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
vector<long long> g(n);
for(int i= 0;i<n;i++) cin >> g[i];
sort(g.begin(),g.end());
long long ans = (n-1)*g[0];
for(int i = 1;i<n;i++) ans += g[i];
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
7 ms |
980 KB |
Output is correct |
3 |
Correct |
13 ms |
980 KB |
Output is correct |
4 |
Correct |
12 ms |
1820 KB |
Output is correct |
5 |
Correct |
14 ms |
1992 KB |
Output is correct |
6 |
Correct |
11 ms |
1748 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
0 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 |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
328 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
328 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
7 ms |
980 KB |
Output is correct |
3 |
Correct |
13 ms |
980 KB |
Output is correct |
4 |
Correct |
12 ms |
1820 KB |
Output is correct |
5 |
Correct |
14 ms |
1992 KB |
Output is correct |
6 |
Correct |
11 ms |
1748 KB |
Output is correct |
7 |
Correct |
0 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 |
0 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 |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
328 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
328 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
6 ms |
1236 KB |
Output is correct |
22 |
Correct |
15 ms |
2092 KB |
Output is correct |
23 |
Correct |
12 ms |
1996 KB |
Output is correct |
24 |
Correct |
20 ms |
1932 KB |
Output is correct |
25 |
Correct |
18 ms |
1988 KB |
Output is correct |
26 |
Correct |
16 ms |
1876 KB |
Output is correct |
27 |
Correct |
23 ms |
1992 KB |
Output is correct |
28 |
Correct |
16 ms |
1788 KB |
Output is correct |
29 |
Correct |
18 ms |
1984 KB |
Output is correct |
30 |
Correct |
15 ms |
1932 KB |
Output is correct |