View Code of Problem 4039

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int i;
	int n,t;
	cin >> n;
	vector<int>v;
	for (i = 0; i < n; ++i)
	{
		cin >> t;
		v.push_back(t);
	}
	//int max = max_element(v.begin(), v.end()) - v.begin();
	sort(v.begin(), v.end());
	long long sum = 0;
	for (i = 0; i < n - 1; ++i)
	{
		sum += (n - i - 1)*v[i];
	}
	cout << sum / n << endl;
	return 0;
}