This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define lg long long
int main()
{
lg n;
cin >> n;
vector<lg> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
for(int i = 2; i < n; i++) v[i] += v[i-1];
if(n == 1)
{
cout << "0\n";
return 0;
}
cout << v[n-1]+v[0]*(n-1) << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |