每个人都有崩溃的时候，就看你的抗压能力到底有多强，如果你的抗压能力强，有办法可以支撑到你能面对并且解决这些困难的话，你就没有问题。                                                                          ----喻言

Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region's culture. Now given the inventory amounts and the prices of all kinds of the mooncakes, together with the maximum total demand of the market, you are supposed to tell the maximum profit that can be made.

Note: partial inventory storage can be taken. The sample shows the following situation: given three kinds of mooncakes with inventory amounts being 180, 150, and 100 thousand tons, and the prices being 7.5, 7.2, and 4.5 billion yuans. If the market demand can be at most 200 thousand tons, the best we can do is to sell 150 thousand tons of the second kind of mooncake, and 50 thousand tons of the third kind. Hence the total profit is 7.2 + 4.5/2 = 9.45 (billion yuans).

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers N (≤1000), the number of different kinds of mooncakes, and D (≤500 thousand tons), the maximum total demand of the market. Then the second line gives the positive inventory amounts (in thousand tons), and the third line gives the positive prices (in billion yuans) of N kinds of mooncakes. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the maximum profit (in billion yuans) in one line, accurate up to 2 decimal places.

Sample Input:

3 200 180 150 100 7.5 7.2 4.5

Sample Output:

9.45 #include <iostream> #include <cstdio> #include <algorithm> #include <string> #include <cstring> #include <cstdlib> #include <cmath> #include <stack> #include <queue> #include <set> #include <map> #include <vector> #include <ctime> #include <cctype> #include <bitset> #include <utility> #include <sstream> #include <complex> #include <iomanip> #include <numeric> #include<unordered_set> #include <climits>//INT_maxnn //#include<bits/stdc++.h> #define PP pair<ll,int> #define inf 0x3f3f3f3f #define llinf 0x3f3f3f3f3f3f3f3fll #define dinf 1000000000000.0 #define PI 3.1415926 #define LL unsigned int #define wc 1e-8 typedef long long ll; using namespace std; const int maxn=1010; struct node { double sto; double sel; double pri; } P[maxn]; bool cmp(node a,node b) { return a.pri>b.pri; } int main() { int n; double m,jg=0; scanf("%d%lf",&n,&m); for(int i=0; i<n; i++) scanf("%lf",&P[i].sto); for(int i=0; i<n; i++) { scanf("%lf",&P[i].sel); P[i].pri=P[i].sel/P[i].sto; } sort(P,P+n,cmp); for(int i=0; i<n; i++) { if(P[i].sto<=m) { m-=P[i].sto; jg+=P[i].sel; } else { jg+=P[i].pri*m; break; } } printf("%.2f\n",jg); return 0; }