# Complete the miniMaxSum function below.
def miniMaxSum(arr):
min_arr = sorted(arr)
max_arr = sorted(arr, reverse=True)
print('{} {}'.format(sum(min_arr[:-1]), sum(max_arr[:-1])))
if __name__ == '__main__':
arr = list(map(int, input().rstrip().split()))
miniMaxSum(arr)
'HackerRank Algorithm' 카테고리의 다른 글
[HackerRank] 07. Migratory Birds (0) | 2020.03.09 |
---|---|
[HackerRank] 06. Min and Max (0) | 2020.03.09 |
[HackerRank] 04. Nested List (0) | 2020.03.09 |
[HackerRank] 03. Sock Merchant (0) | 2020.03.09 |
[HackerRank] 02. Sum and Prod (0) | 2020.03.09 |
댓글