Submission #2240447

---

Source Code Expand

import math

N, a, b = map(int, input().split())
product_list = sorted(map(int, input().split()), reverse = True)

def nCm(n, m):
    return math.factorial(n) / (math.factorial(m) * (math.factorial(n - m)))

# average_list
average_list = []
average_idx = []
for i in range(a, b+1):
    average = sum(product_list[:i]) / i
    average_list.append(average)
    average_idx.append(i)

max_average = max(average_list)
max_average_idx = [average_idx[i] for i in range(len(average_list)) if average_list[i] == max_average]

pattern_num = int(0)

for i in max_average_idx:
    choice_num = product_list[:i].count(product_list[i-1])
    all_num = product_list.count(product_list[i-1])

    pattern_num += int(nCm(all_num, choice_num))

print(float(max_average), pattern_num)

Submission Info

Judge Result