-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMini-Max Sum
67 lines (52 loc) · 1.05 KB
/
Mini-Max Sum
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the miniMaxSum function below.
def miniMaxSum(arr):
sum1=0
sum2=0
sum3=0
sum4=0
sum5=0
for i in range(0,5):
if i==0:
continue
else:
sum1= sum1+ arr[i]
for j in range(0,5):
if j==1:
continue
else:
sum2= sum2+ arr[j]
for k in range(0,5):
if k==2:
continue
else:
sum3= sum3+ arr[k]
for l in range(0,5):
if l==3:
continue
else:
sum4= sum4+ arr[l]
for m in range(0,5):
if m==4:
continue
else:
sum5= sum5+ arr[m]
#print(sum1)
#print(sum2)
#print(sum3)
#print(sum4)
#print(sum5)
arr1=[sum1,sum2,sum3,sum4,sum5]
#print(arr1)
arr1.sort()
min1= arr1[0]
max1= arr1[4]
print("{} {}".format(min1,max1))
if __name__ == '__main__':
arr = list(map(int, input().rstrip().split()))
miniMaxSum(arr)