https://www.hackerrank.com/challenges/mini-max-sum/problem
HackerRank - Mini-Max Sum
#!/bin/python3
import math
import os
import random
import re
import sys
def miniMaxSum(arr):
arr.sort()
everySum = 0
for number in arr:
everySum += number
miniSum = everySum - arr[4]
maxSum = everySum - arr[0]
print(miniSum, maxSum)
if __name__ == '__main__':
arr = list(map(int, input().rstrip().split()))
miniMaxSum(arr)
'알고리즘 문제 풀기 > HackerRank' 카테고리의 다른 글
HackerRank - Time Conversion (0) | 2019.01.16 |
---|---|
HackerRank - Birthday Cake Candles (0) | 2019.01.15 |
HackerRank - Staircase (0) | 2019.01.13 |
HackerRank - Plus Minus (0) | 2019.01.12 |
HackerRank - Diagonal Difference (0) | 2019.01.11 |