CF954E.Water Taps
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Consider a system of n water taps all pouring water into the same container. The i -th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i -th tap has temperature ti .
If for every you set i -th tap to deliver exactly xi ml of water per second, then the resulting temperature of water will be
(if
, then to avoid division by zero we state that the resulting water temperature is 0 ).
You have to set all the water taps in such a way that the resulting temperature is exactly T . What is the maximum amount of water you may get per second if its temperature has to be T ?
输入格式
The first line contains two integers n and T ( 1<=n<=200000 , 1<=T<=106 ) — the number of water taps and the desired temperature of water, respectively.
The second line contains n integers a1 , a2 , ..., an ( 1<=ai<=106 ) where ai is the maximum amount of water i -th tap can deliver per second.
The third line contains n integers t1 , t2 , ..., tn ( 1<=ti<=106 ) — the temperature of water each tap delivers.
输出格式
Print the maximum possible amount of water with temperature exactly T you can get per second (if it is impossible to obtain water with such temperature, then the answer is considered to be 0 ).
Your answer is considered correct if its absolute or relative error doesn't exceed 10−6 .
输入输出样例
输入#1
2 100 3 10 50 150
输出#1
6.000000000000000
输入#2
3 9 5 5 30 6 6 10
输出#2
40.000000000000000
输入#3
2 12 1 3 10 15
输出#3
1.666666666666667