题解

ACGO欢乐赛#57 T2题解

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int n,a[maxn];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	cout<<a[n]*a[n]*a[n]+a[n-1]*a[n-1]+a[n-2];
	return 0;
}