Hackerearth Problem min-max of N positive Integers : Solution in Python

PROBLEM STATEMENT

Points: 30

Given A Series Of N Positive Integers a₁,a₂,a₃........a_n. , Find The Minimum And Maximum Values That Can Be Calculated By Summing Exactly N-1 Of The N Integers. Then Print The Respective Minimum And Maximum Values As A Single Line Of Two Space-Separated Long Integers.

Input Format

First Line Take Input Value Of N

Second Line Take Input N Space Separated Integer Value

Output Format

Two Space Separated Value ( One Maximum Sum And One Minimum Sum )

Constraints

• 0 < N < 100001
• 0 <= a_i < 10¹³

SAMPLE INPUT

5
1 2 3 4 5

SAMPLE OUTPUT

10 14

Explanation

Our initial numbers are 1,2,3,4 and 5. We can calculate the following sums using four of the five integers:

1. If we sum everything except 1, our sum is 2+3+4+5=14 .
2. If we sum everything except 2, our sum is 1+3+4+5=13 .
3. If we sum everything except 3, our sum is 1+2+4+5=12 .
4. If we sum everything except 4, our sum is 1+3+4+5=11 .
5. If we sum everything except 5, our sum is 1+2+3+4=10 .

As you can see, the minimal sum is 1+2+3+4=10 and the maximal sum is 2+3+4+5=14. Thus, we print these minimal and maximal sums as two space-separated integers on a new line.

Solution in Python :

import array
n = int(input())
nums = input()
list1 = nums.split()
list1 = [int(i) for i in list1]
list1.sort()
total = sum(list1)
min = total - list1[len(list1)-1]
max = total - list1[0]
print(min,max)