#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
#define endl ('\n')
using namespace std;
int32_t main(){
fast
int n;
cin>>n;
vector<int>x(n);
for(int i=0;i<n;i++){
cin>>x[i];
}
if(n==1){
cout<<0<<endl;
return 0;
}
sort(x.begin(),x.end());
int res=0;
for(int i=1;i<n;i++){
res+=x[i]+x[0];;
}
cout<<res<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
1372 KB |
Output is correct |
3 |
Correct |
8 ms |
2084 KB |
Output is correct |
4 |
Correct |
8 ms |
1884 KB |
Output is correct |
5 |
Correct |
8 ms |
2144 KB |
Output is correct |
6 |
Correct |
7 ms |
1888 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
352 KB |
Output is correct |
4 |
Correct |
0 ms |
360 KB |
Output is correct |
5 |
Correct |
0 ms |
352 KB |
Output is correct |
6 |
Correct |
0 ms |
352 KB |
Output is correct |
7 |
Correct |
1 ms |
352 KB |
Output is correct |
8 |
Correct |
1 ms |
616 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
356 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
352 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
1372 KB |
Output is correct |
3 |
Correct |
8 ms |
2084 KB |
Output is correct |
4 |
Correct |
8 ms |
1884 KB |
Output is correct |
5 |
Correct |
8 ms |
2144 KB |
Output is correct |
6 |
Correct |
7 ms |
1888 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
352 KB |
Output is correct |
10 |
Correct |
0 ms |
360 KB |
Output is correct |
11 |
Correct |
0 ms |
352 KB |
Output is correct |
12 |
Correct |
0 ms |
352 KB |
Output is correct |
13 |
Correct |
1 ms |
352 KB |
Output is correct |
14 |
Correct |
1 ms |
616 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
356 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
352 KB |
Output is correct |
19 |
Correct |
0 ms |
344 KB |
Output is correct |
20 |
Correct |
0 ms |
356 KB |
Output is correct |
21 |
Correct |
4 ms |
1372 KB |
Output is correct |
22 |
Correct |
8 ms |
2012 KB |
Output is correct |
23 |
Correct |
8 ms |
2144 KB |
Output is correct |
24 |
Correct |
11 ms |
2080 KB |
Output is correct |
25 |
Correct |
13 ms |
2140 KB |
Output is correct |
26 |
Correct |
12 ms |
1892 KB |
Output is correct |
27 |
Correct |
13 ms |
2124 KB |
Output is correct |
28 |
Correct |
12 ms |
1888 KB |
Output is correct |
29 |
Correct |
13 ms |
2140 KB |
Output is correct |
30 |
Correct |
8 ms |
1944 KB |
Output is correct |