#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long sum = 0;//ll because the values of d[i] can be upto 1e9
vector<long long>d(n + 1);
for (int i = 1;i<=n;i++)cin>>d[i];
sort(d.begin() + 1,d.end());//in-built sort operation
for (int i = 1;i<=n;i++)
sum += d[i];
sum += (n - 2) * d[1];
//because d is sorted => d[1] is the SMALLEST element
cout<<sum;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
19 ms |
1204 KB |
Output is correct |
| 3 |
Correct |
41 ms |
1920 KB |
Output is correct |
| 4 |
Correct |
32 ms |
1800 KB |
Output is correct |
| 5 |
Correct |
37 ms |
1964 KB |
Output is correct |
| 6 |
Correct |
34 ms |
1772 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
300 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
19 ms |
1204 KB |
Output is correct |
| 3 |
Correct |
41 ms |
1920 KB |
Output is correct |
| 4 |
Correct |
32 ms |
1800 KB |
Output is correct |
| 5 |
Correct |
37 ms |
1964 KB |
Output is correct |
| 6 |
Correct |
34 ms |
1772 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
300 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 |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
13 ms |
1108 KB |
Output is correct |
| 22 |
Correct |
42 ms |
2056 KB |
Output is correct |
| 23 |
Correct |
40 ms |
1964 KB |
Output is correct |
| 24 |
Correct |
40 ms |
1868 KB |
Output is correct |
| 25 |
Correct |
42 ms |
2036 KB |
Output is correct |
| 26 |
Correct |
39 ms |
1892 KB |
Output is correct |
| 27 |
Correct |
45 ms |
1940 KB |
Output is correct |
| 28 |
Correct |
40 ms |
1868 KB |
Output is correct |
| 29 |
Correct |
41 ms |
1992 KB |
Output is correct |
| 30 |
Correct |
40 ms |
1868 KB |
Output is correct |
