#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const ll maxn = 5e5+5;
const ll add = 1e5;
ll n;
ll A[maxn];
void solve()
{
cin >> n;
ll sum = 0;
ll value = LLONG_MAX;
for(int i = 1; i<= n; i++)
{
cin >> A[i];
sum += A[i];
value = min(value, A[i]);
}
sum -= value;
sum += (n-1)*value;
cout << sum;
}
int main()
{
ios_base::sync_with_stdio(NULL) ; cin.tie(nullptr) ; cout.tie(nullptr);
ll test_case = 1;
while(test_case--)
{
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Correct |
6 ms |
1364 KB |
Output is correct |
3 |
Correct |
14 ms |
1736 KB |
Output is correct |
4 |
Correct |
9 ms |
1672 KB |
Output is correct |
5 |
Correct |
11 ms |
1776 KB |
Output is correct |
6 |
Correct |
9 ms |
1652 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
340 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 |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Correct |
6 ms |
1364 KB |
Output is correct |
3 |
Correct |
14 ms |
1736 KB |
Output is correct |
4 |
Correct |
9 ms |
1672 KB |
Output is correct |
5 |
Correct |
11 ms |
1776 KB |
Output is correct |
6 |
Correct |
9 ms |
1652 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
340 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 |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
5 ms |
1236 KB |
Output is correct |
22 |
Correct |
13 ms |
1836 KB |
Output is correct |
23 |
Correct |
10 ms |
1740 KB |
Output is correct |
24 |
Correct |
11 ms |
1672 KB |
Output is correct |
25 |
Correct |
11 ms |
1752 KB |
Output is correct |
26 |
Correct |
10 ms |
1632 KB |
Output is correct |
27 |
Correct |
10 ms |
1788 KB |
Output is correct |
28 |
Correct |
10 ms |
1624 KB |
Output is correct |
29 |
Correct |
10 ms |
1676 KB |
Output is correct |
30 |
Correct |
12 ms |
1748 KB |
Output is correct |