【水比例】#41 A. Guilty — to the kitchen!

A. Guilty — to the kitchen!

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It's a very unfortunate day for Volodya today. He got bad mark in algebra and was therefore forced to do some work in the kitchen, namely to cook borscht (traditional Russian soup). This should also improve his algebra skills.

According to the borscht recipe it consists of n ingredients that have to be mixed in proportion  litres (thus, there should be a1 ·x, ..., an ·x litres of corresponding ingredients mixed for some non-negative x). In the kitchen Volodya found out that he has b1, ..., bn litres of these ingredients at his disposal correspondingly. In order to correct his algebra mistakes he ought to cook as much soup as possible in a V litres volume pan (which means the amount of soup cooked can be between 0 and V litres). What is the volume of borscht Volodya will cook ultimately?

Input

The first line of the input contains two space-separated integers n and V (1 ≤ n ≤ 20, 1 ≤ V ≤ 10000). The next line contains n space-separated integers ai (1 ≤ ai ≤ 100). Finally, the last line contains n space-separated integers bi (0 ≤ bi ≤ 100).

Output

Your program should output just one real number — the volume of soup that Volodya will cook. Your answer must have a relative or absolute error less than 10 - 4.

Sample test(s)

input

1 100
1
40

output

40.0

input

2 100
1 1
25 30

output

50.0

input

2 100
1 1
60 60

output

100.0

这道题的意思是说有这么多种原料，原料们要按照a[i]的比例来加，问最终最多能做多少升汤

首先用每个b去除以a找到木桶效应的那个短板，就是商最小的那个，记住这个值，然后用这个值来乘以总权值，和V进行比较即可。

#include <queue>
#include <cmath> 
#include <memory> 
#include <cctype>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	int n,v,index;
	cin>>n>>v;
	pair<double,double> p[21];
	double a[21],b[21];
	memset(a,0,sizeof a);
	for(int i=0;i<n;i++)	cin>>a[i];
	for(int i=0;i<n;i++)	cin>>b[i];
	double min=10009.9;
	for(int i=0;i<n;i++)	
	{
		p[i].first=a[i];
		p[i].second=b[i]/a[i];
		if(min>p[i].second)	min=p[i].second;
	}
	double ans=0.0;
	for(int i=0;i<n;i++)	ans+=p[i].first;
	ans*=min;
	ans =(ans>v?v:ans);
	cout<<ans;
	return 0;
}