Algorithm


E. Water Taps
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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?

Input

The first line contains two integers n and T (1 ≤ n ≤ 2000001 ≤ T ≤ 106) — the number of water taps and the desired temperature of water, respectively.

The second line contains n integers a1a2, ..., 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 t1t2, ..., tn (1 ≤ ti ≤ 106) — the temperature of water each tap delivers.

Output

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.

Examples
input
Copy
2 100
3 10
50 150
output
Copy
6.000000000000000
input
Copy
3 9
5 5 30
6 6 10
output
Copy
40.000000000000000
input
Copy
2 12
1 3
10 15
output
Copy
1.666666666666667

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 2e5 + 1;
int n, T;
long long to1, to2;
pair<int, int> at[N];

int main() {
  scanf("%d %d", &n, &T);
  for(int i = 0; i < n; ++i) {
  	scanf("%d", &at[i].second);
  	to2 += at[i].second;
  }
  for(int i = 0; i < n; ++i) {
  	scanf("%d", &at[i].first);
  	to1 += 1ll * at[i].first * at[i].second;
  }

  sort(at, at + n);
  reverse(at, at + n);

  if(to1 < T * to2) {
  	T *= -1;
    for(int i = 0; i < n; ++i)
      at[i].first *= -1;
    reverse(at, at + n);
    to1 *= -1;
  }

  int i = 0;
  while(i < n && to1 > T * to2)
  	to1 -= 1ll * at[i].first * at[i].second, to2 -= at[i].second, ++i;
  --i;

  double l = 0, r = at[i].second, mid, res = 0;
  for(int j = 0; j < 100; ++j) {
  	mid = (l + r) / 2;
  	if(1ll * mid * at[i].first + to1 <= 1ll * T * (mid + to2))
  		res = l = mid;
  	else
  		r = mid;
  }

  printf("%.10lf\n", to2 + res);

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
2 100
3 10
50 150

Output

x
+
cmd
6.000000000000000
Advertisements

Demonstration


Codeforces Solution-Water Taps-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+