#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
int n;
cin>>n;
vector<ll> v(n);
for(auto &i:v) cin>>i;
sort(v.begin(),v.end());
ll ans = v[0] * (n - 1);
for(int i=1;i<n;i++) ans += v[i];
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
6 ms |
1368 KB |
Output is correct |
3 |
Correct |
9 ms |
2088 KB |
Output is correct |
4 |
Correct |
8 ms |
1880 KB |
Output is correct |
5 |
Correct |
14 ms |
2140 KB |
Output is correct |
6 |
Correct |
9 ms |
1944 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 |
456 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 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 |
460 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
6 ms |
1368 KB |
Output is correct |
3 |
Correct |
9 ms |
2088 KB |
Output is correct |
4 |
Correct |
8 ms |
1880 KB |
Output is correct |
5 |
Correct |
14 ms |
2140 KB |
Output is correct |
6 |
Correct |
9 ms |
1944 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 |
456 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
460 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
344 KB |
Output is correct |
21 |
Correct |
5 ms |
1372 KB |
Output is correct |
22 |
Correct |
9 ms |
2140 KB |
Output is correct |
23 |
Correct |
10 ms |
2128 KB |
Output is correct |
24 |
Correct |
15 ms |
1880 KB |
Output is correct |
25 |
Correct |
14 ms |
2140 KB |
Output is correct |
26 |
Correct |
13 ms |
2064 KB |
Output is correct |
27 |
Correct |
14 ms |
2140 KB |
Output is correct |
28 |
Correct |
13 ms |
1884 KB |
Output is correct |
29 |
Correct |
14 ms |
2140 KB |
Output is correct |
30 |
Correct |
10 ms |
2196 KB |
Output is correct |