912A Tricky Alchemy

A. Tricky Alchemy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.

Grisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellowball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.

Right now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.

Input

The first line features two integers A and B (0 ≤ A, B ≤ 109), denoting the number of yellow and blue crystals respectively at Grisha's disposal.

The next line contains three integers xy and z (0 ≤ x, y, z ≤ 109) — the respective amounts of yellow, green and blue balls to be obtained.

Output

Print a single integer — the minimum number of crystals that Grisha should acquire in addition.

Examples
input
4 3
2 1 1
output
2
input
3 9
1 1 3
output
1
input
12345678 87654321
43043751 1000000000 53798715
output
2147483648
Note

In the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue.


题意:在冬天的假期,需要三种颜色的圣诞球,一个黄色球,需要两个黄色晶体合

成,一个绿色球,需要一个黄色和一个蓝色晶体合成,蓝色球需要三个蓝色晶体合成。
输入a,b代表给的黄色晶体和蓝色晶体数量,第二行,需要制作的球数量,x需要黄色球,y绿色求,z蓝色球。问最少还需要额外的多少晶体,才能制作出这些球。
题解:模拟就行    最少需要额外多少晶体,只给了两种颜色的晶体,我们先制作少的绿色球合成,然后黄色,最后蓝色,减去已经合成的球用掉的晶体数量,如果剩余的晶体数量,不够,就代表额外的,ans加起来就ok,还要注意的就是不够的话,就代表额外需要的,要把原来颜色的晶体置为0
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long a,b,x,y,z,ans;
    while(cin>>a>>b>>x>>y>>z)
    {
        ans=0;
        if(y<=a) a-=y;
        else    ans+=y-a,a=0;
        if(y<=b)  b-=y;
        else ans+=y-b,b=0;
        if(x*2<=a) a-=x*2;
        else ans+=x*2-a,a=0;
        if(z*3<=b) b-=z*3;
        else ans+=z*3-b,b=0;
        cout<<ans<<endl;
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

落凡尘.

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值