# 20115 에너지드링크

백준 알고리즘

문제 보기20115
풀이1

n = int(input())
drink_list = list(map(int, input().split()))
drink_list.sort(reverse=True)

max_sum = drink_list[0] + sum(drink_list[1:])/2
print(max_sum)

풀이2
버블정렬 활용

n = int(input())
drink_list = list(map(int, input().split()))

def get_max(drink_list):
    for i in range(len(drink_list)):
        swap = 0
        for i2 in range(len(drink_list)-1-i):
            if drink_list[i2] < drink_list[i2 + 1]:
                drink_list[i2], drink_list[i2 + 1] = drink_list[i2 + 1], drink_list[i2]
                swap += 1
        if swap == 0:
            return  drink_list[0] + sum(drink_list[1:])/2

print(get_max(drink_list))