Category
Similar Problems

0109. Massiv9

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massivni M dan katta elementlarini ko`paytmalarini logarifmi xisoblansin

Kiruvchi ma`lumotlar: Birinchi satrda N ($1\le N \le100$). Ikkinchi satrda N ta butun son($0\le a[i] \le 100$). Uchinchi satrda M ($1\le M \le 100$);

Chiquvchi ma`lumotlar: Masala yechimlari $10^{-2}$ aniqlikda

Input
5
26 18 32 68 81
6
Output
18.23
Input
10
49 39 42 12 53 35 94 21 35 12
12
Output
29.96