Guilty — to the kitchen!

55 篇文章 0 订阅
22 篇文章 0 订阅

Description
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 Input
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
题意:让你做汤,第一行n、 V(体积),第二行n个数,表示比例,第三行n个数,表示给你的食材量,让你求最终的体积。
思路:第二行b 除以第一行a,求出最小的 t,然后再把a求和,再乘 t再和V比较。
坑点就是输出时没有告诉你保留几位小数,我看样例是保留一位,然后就一直错。
看一下我的代码吧

#include <stdio.h>
#include <string.h>
struct xx
{
    double a, b, mm;
}x[100];
int main()
{
    int n, V;
    while(~scanf("%d %d", &n, &V))
    {
        double ans = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%lf", &x[i].a);
            ans += x[i].a;
        }
        for(int i = 0; i < n; i++)
            scanf("%lf", &x[i].b);
        double min = 2000000;
        for(int i = 0; i < n; i++)
        {
            x[i].mm = x[i].b / x[i].a;
            if(min > x[i].mm)
                min = x[i].mm;
        }
        ans *= min;
        if(ans > V) printf("%d\n", V);
        else printf("%lf\n", ans);
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值