Submission #864417

#TimeUsernameProblemLanguageResultExecution timeMemory
864417TAhmed33Autići (COCI22_autici)C++98
50 / 50
33 ms2140 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e5 + 25;
int arr[MAXN];
signed main () {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> arr[i];
	if (n == 1) {
		cout << "0\n";
		return 0;
	}
	long long sum = 0;
	sort(arr + 1, arr + n + 1);
	for (int i = 2; i <= n; i++) sum += arr[i];
	sum += (n - 1) * arr[1];
	cout << sum << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...