/**
* author: NotLinux
* created: 08.09.2022 ~ 09:16:33
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL
#include "/home/notlinux/debug.h"
#else
#define debug(x...) void(37)
#endif
void solve(){
int n;cin >> n;
vector < int > arr(n) ;
for(auto &inp : arr)cin >> inp;
sort(arr.begin(),arr.end());
int ans = accumulate(arr.begin()+1,arr.end(),0LL) + (arr[0])*(n-1);
cout << ans << endl;
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(nullptr);
int tt=1;
// cin >> tt;
while(tt--)solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
6 ms |
1236 KB |
Output is correct |
3 |
Correct |
14 ms |
2132 KB |
Output is correct |
4 |
Correct |
10 ms |
1876 KB |
Output is correct |
5 |
Correct |
11 ms |
1996 KB |
Output is correct |
6 |
Correct |
10 ms |
1872 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
0 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
6 ms |
1236 KB |
Output is correct |
3 |
Correct |
14 ms |
2132 KB |
Output is correct |
4 |
Correct |
10 ms |
1876 KB |
Output is correct |
5 |
Correct |
11 ms |
1996 KB |
Output is correct |
6 |
Correct |
10 ms |
1872 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 |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
0 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
6 ms |
1236 KB |
Output is correct |
22 |
Correct |
15 ms |
2096 KB |
Output is correct |
23 |
Correct |
11 ms |
1988 KB |
Output is correct |
24 |
Correct |
16 ms |
1932 KB |
Output is correct |
25 |
Correct |
17 ms |
2084 KB |
Output is correct |
26 |
Correct |
16 ms |
1928 KB |
Output is correct |
27 |
Correct |
19 ms |
1996 KB |
Output is correct |
28 |
Correct |
15 ms |
1876 KB |
Output is correct |
29 |
Correct |
16 ms |
2044 KB |
Output is correct |
30 |
Correct |
13 ms |
1936 KB |
Output is correct |