CF939E Maximize!
Description
You are given a multiset $ S $ consisting of positive integers (initially empty). There are two kind of queries:
1. Add a positive integer to $ S $ , the newly added integer is not less than any number in it.
2. Find a subset $ s $ of the set $ S $ such that the value  is maximum possible. Here $ max(s) $ means maximum value of elements in $ s $ ,  — the average value of numbers in $ s $ . Output this maximum possible value of .
Input Format
N/A
Output Format
N/A