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.
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.
Print a single integer — the minimum number of crystals that Grisha should acquire in addition.
4 3 2 1 1
2
3 9 1 1 3
1
12345678 87654321 43043751 1000000000 53798715
2147483648
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;
}