Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • IoT ? Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone

HackerEarth Fredo and Sums problem solution

YASH PAL, 31 July 2024
In this HackerEarth Fredo and Sums problem solution, Fredo has an array A consisting of N elements. He wants to divide the array into N/2 pairs where each array element comes in exactly one pair. Say that pair i has elements Xi and Yi, he defines S as :
S = Sigma(i=1,N/2) abs(Xi – Yi)
He asks you to find the minimum and maximum value of S.
HackerEarth Fredo and Sums problem solution

HackerEarth Fredo and Sums problem solution.

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
cin>>t;
assert(t>=1 && t<=10);
while(t--)
{
int n,a[100005];
cin>>n;
assert(n>=1 & n<=1e5);
assert(!(n&1));
for(int i=0;i<n;i++)
{
cin>>a[i];
assert(a[i]>=-1e9 && a[i]<=1e9);
}
sort(a,a+n);
ll mins=0,maxs=0;
for(int i=1;i<n;i+=2)
mins+=(ll)(a[i]-a[i-1]);
for(int i=0;i<n/2;i++)
maxs+=(ll)(a[n-1-i]-a[i]);
cout<<mins<<" "<<maxs<<"n";
}
return 0;
}
coding problems solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes