306896: CF1267G. Game Relics

Memory Limit:512 MB Time Limit:3 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Game Relics

题意翻译

现在有 $n$ 种圣物,其中第 $i$ 个圣物的价格为 $c_i$ 碎片。你想把这 $n$ 种圣物全买一遍,其中有两种购买方式: - 花费 $c_i$ 碎片购买第 $i$ 种圣物。 - 花费 $x$ 碎片进行抽奖,可以等概率随机获得这 $n$ 种圣物中的一种,如果获得了已经获得过的圣物,则会还给你 $\frac{x}{2}$ 碎片。 现在求最优策略下,得到这 $n$ 种圣物的最小期望花费。

题目描述

Esports is a form of competitive sports using video games. Dota 2 is one of the most popular competitive video games in Esports. Recently, a new video game Dota 3 was released. In Dota 3 a player can buy some relics for their hero. Relics are counters that track hero's actions and statistics in a game. Gloria likes to play Dota 3, so she wants to buy all $ n $ available relics for her favorite hero. Relics can be bought using an in-game currency called shards. Each relic has its own price — $ c_i $ shards for the $ i $ -th relic. A player can buy a relic using one of the following options: - Pay $ c_i $ shards to buy the $ i $ -th relic; - Pay $ x $ shards and randomly get one of all $ n $ relics. The probability of getting a relic is the same for all $ n $ relics. If a duplicate relic is received, then the relic is recycled and $ \frac{x}{2} $ shards are given back to the player. Gloria wants to buy all $ n $ relics. Help her minimize the expected number of shards she spends to buy all the relics.

输入输出格式

输入格式


The first line contains two integers $ n $ and $ x $ ( $ 1 \le n \le 100 $ ; $ 1 \le x \le 10\,000 $ ) — the number of relics and the cost to receive a random relic. The second line consists of $ n $ integers $ c_1, c_2, \ldots, c_n $ ( $ x \le c_i \le 10\,000 $ ; $ \sum{c_i} \le 10\,000 $ ) — the prices of $ n $ relics.

输出格式


Print a single real number — the minimum expected number of shards that Gloria must spend to buy all the relics. The absolute or relative error should not exceed $ 10^{-9} $ .

输入输出样例

输入样例 #1

2 20
25 100

输出样例 #1

47.50000000000000000

输入样例 #2

4 30
60 50 60 80

输出样例 #2

171.25000000000000000

说明

In the first example, the optimal strategy is to randomly get one of the two relics paying $ 20 $ shards. Then there are two scenarios. The first one happens if Gloria receives the first relic. Then she keeps getting random relics until she obtains the second relic. The expected number of shards to spend in this scenario is $ 20 + 30 = 50 $ . In the second scenario, Gloria initially gets the second relic. Then it is better to buy the first relic for $ 25 $ shards, so the expected number of shards to spend in this scenario is $ 20 + 25 = 45 $ . Thus, the expected number of shards to spend is $ \frac{50 + 45}{2} = 47.5 $ .

Input

题意翻译

现在有 $n$ 种圣物,其中第 $i$ 个圣物的价格为 $c_i$ 碎片。你想把这 $n$ 种圣物全买一遍,其中有两种购买方式: - 花费 $c_i$ 碎片购买第 $i$ 种圣物。 - 花费 $x$ 碎片进行抽奖,可以等概率随机获得这 $n$ 种圣物中的一种,如果获得了已经获得过的圣物,则会还给你 $\frac{x}{2}$ 碎片。 现在求最优策略下,得到这 $n$ 种圣物的最小期望花费。

加入题单

上一题 下一题 算法标签: