Mini-Max Sum - HackerRank || HackerRank Mini-Max Sum Solution
Problem Name: Mini-Max Sum
Judge: HackerRank
Problem link: Mini-Max Sum
HackerRank Mini-Max Sum Solution in C
#include <stdio.h>
int main()
{
long long array[5],sum = 0, i, max_sum, min_sum;
for (i = 0; i < 5; i++)
{
scanf("%lld", &array[i]);
sum = sum + array[i];
}
long long minimum = array[0], maximum = array[0];
for (i = 0; i < 5; i++)
{
if (array[i] > maximum) maximum = array[i];
if (array[i] < minimum) minimum = array[i];
}
min_sum = sum - maximum;
max_sum = sum - minimum;
printf("%lld %lld\n", min_sum, max_sum);
return 0;
}
HackerRank Mini-Max Sum Solution in C++/Cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long array[5], i, max_sum, min_sum, sum = 0;
for (i = 0; i < 5; i++)
{
cin >> array[i];
sum = sum + array[i];
}
long long minimum = array[0], maximum = array[0];
for (i = 0; i < 5; i++)
{
if (array[i] > maximum) maximum = array[i];
if (array[i] < minimum) minimum = array[i];
}
min_sum = sum - maximum;
max_sum = sum - minimum;
cout << min_sum << " " << max_sum << endl;
return 0;
}
HackerRank Mini-Max Sum Solution in Java
import java.util.Scanner;
public class Mini_Max_Sum {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long[] array = new long[5];
long max, min, i, sum = 0;
for (i = 0; i < 5; i++) {
array[(int) i] = input.nextInt();
sum = sum + array[(int) i];
}
max = array[0];
min = array[0];
for (i = 0; i < array.length; i++) {
if (array[(int) i] > max) max = array[(int) i];
if (array[(int) i] < min) min = array[(int) i];
}
long r1 = sum - max;
long r2 = sum - min;
System.out.println(r1 + " " + r2);
}
}
