#include <bits/stdc++.h>
using namespace std;
#define sp << " " <<
#define int long long
#define vi vector<int>
#define pb push_back
const int N = 1e5+1;
void solve() {
int n;
cin >> n;
vi a(n+1);
for (int i=1;i<=n;i++) cin >> a[i];
int sm =0;
for (int i=1;i<=n;i++) sm+=a[i];
int mn = *min_element(a.begin()+1,a.end());
cout << (n-1)*mn+sm-mn << endl;
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
504 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1372 KB |
Output is correct |
| 3 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 4 |
Correct |
8 ms |
1880 KB |
Output is correct |
| 5 |
Correct |
10 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
8 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 |
432 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 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 |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
504 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1372 KB |
Output is correct |
| 3 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 4 |
Correct |
8 ms |
1880 KB |
Output is correct |
| 5 |
Correct |
10 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
8 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 |
432 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 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 |
344 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
4 ms |
1372 KB |
Output is correct |
| 22 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 23 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 24 |
Correct |
8 ms |
2068 KB |
Output is correct |
| 25 |
Correct |
8 ms |
1992 KB |
Output is correct |
| 26 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 27 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 28 |
Correct |
8 ms |
1796 KB |
Output is correct |
| 29 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 30 |
Correct |
8 ms |
2136 KB |
Output is correct |
