#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin>>n;
int a[n+3];
int mn = INF;
int sum = 0;
for(int i= 1;i<=n;i++){
cin>>a[i];
sum += a[i];
mn = min(mn, a[i]);
}
sum -= mn;
sum += mn*(n-1);
cout<<sum<<endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
14 ms |
2004 KB |
Output is correct |
| 4 |
Correct |
10 ms |
1824 KB |
Output is correct |
| 5 |
Correct |
11 ms |
1976 KB |
Output is correct |
| 6 |
Correct |
9 ms |
1748 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
328 KB |
Output is correct |
| 6 |
Correct |
1 ms |
328 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
328 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
14 ms |
2004 KB |
Output is correct |
| 4 |
Correct |
10 ms |
1824 KB |
Output is correct |
| 5 |
Correct |
11 ms |
1976 KB |
Output is correct |
| 6 |
Correct |
9 ms |
1748 KB |
Output is correct |
| 7 |
Correct |
1 ms |
316 KB |
Output is correct |
| 8 |
Correct |
1 ms |
320 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
328 KB |
Output is correct |
| 12 |
Correct |
1 ms |
328 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
328 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
8 ms |
1236 KB |
Output is correct |
| 22 |
Correct |
17 ms |
2076 KB |
Output is correct |
| 23 |
Correct |
12 ms |
1996 KB |
Output is correct |
| 24 |
Correct |
10 ms |
1904 KB |
Output is correct |
| 25 |
Correct |
12 ms |
1964 KB |
Output is correct |
| 26 |
Correct |
9 ms |
1868 KB |
Output is correct |
| 27 |
Correct |
11 ms |
2004 KB |
Output is correct |
| 28 |
Correct |
10 ms |
1900 KB |
Output is correct |
| 29 |
Correct |
11 ms |
1944 KB |
Output is correct |
| 30 |
Correct |
12 ms |
1920 KB |
Output is correct |
