Grow The Tree CodeForces - 1248B

https://vjudge.net/problem/CodeForces-1248B

#include <bits/stdc++.h>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N=2e5+9;

int a[N];

int main()
{
    FAST_IO;

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+1+n);

    ll sum1=0;
    ll sum2=0;
    for(int i=1;i<=n;i++)
    {
        if(i<=n/2) sum1+=a[i];
        else sum2+=a[i];
    }
    ll ans=sum1*sum1+sum2*sum2;

    cout<<ans<<endl;


    return 0;
}