L - Tricky Alchemy棘手的炼金术

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 yellow ball 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 x, y 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

1个黄球需要2个黄水晶;
1个绿球需要1个黄和1个蓝水晶;
1个蓝球需要3个蓝水晶;

第一个实例中,你拥有4个黄水晶和3个蓝水晶,但是你要分别制作2个黄球、1个绿球、1个蓝球,你需要5个黄水晶和4个蓝水晶,这时你缺少2个水晶。

注意要用long long

#include<iostream>
using namespace std;
int main()
{
	long long int cye,cbu,bye,bgr,bbu,ye,bu,y,b;
	cin>>cye>>cbu>>bye>>bgr>>bbu;
	ye=bye*2+bgr;
	bu=bgr+bbu*3;
	y=ye-cye;
	b=bu-cbu;
	if(y<0) y=0;//无缺少的情况
	if(b<0) b=0;//无缺少的情况 
	cout<<(y+b)<<endl;
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值