这程序开O2都过了

#include <bits/stdc++.h>
using namespace std;
int a[10001];
int main()
{
	int n,i,ans;
	cin>>n;
	for (i=1;i<=n;i++) cin>>a[i];
	ans=0;
	for (i=1;i<=n-1;i++)
	{
		sort(a+i,a+n+1);
		ans=ans+a[i]+a[i+1];
		a[i+1]=a[i]+a[i+1];
	}
	cout<<ans<<endl;
	cout<<endl;
	cout<<endl;
	return 0;
}

正解是O(n*log(n))的堆