greedy implementation math sortings *900

Please click on ads to support us..

Python Code:



n=int(input())
a=sorted([int(x) for x in input().split()])
somme=0
for x in range(n//2):
    somme+=(a[x]+a[-x-1])**2
print(somme)


C++ Code:

#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
#define ll long long
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define joan ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
ll n,a[300000+3];
int main()
{
    joan;
cin>>n;
for(int i=0;i<n;i++)
    cin>>a[i];
sort(a,a+n);
ll ans=0;
for(int i=0;i<n/2;i++)
{
ans+=pow(a[i]+a[n-1-i],2);
}
cout<<ans;
}


Comments

Submit
0 Comments
More Questions

1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array