Codeforces Round #456 (Div. 2) A. Tricky Alchemy

传送门：http://codeforces.com/contest/912/problem/A

A. Tricky Alchemy

time limit per test1 second
memory limit per test256 megabytes

Problem Description

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

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.

---

解题心得：

1. 很简单的一个模拟题，题意也很简单就不说了，在比赛的时候头脑发昏，居然用算出的和加起来去减给出的晶块数目的和，简直想砍掉自己的脑袋。
2. 注意使用long long数据量有点大。

---

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    ll a,b,x1,x2,x3;
    scanf("%lld%lld%lld%lld%lld",&a,&b,&x1,&x2,&x3);
    ll y1,y2;
    y1 = y2 = 0;//记录需要使用的晶块的数量

    y1 += x1*2;
    y2 += x2;
    y1 += x2;
    y2 += x3*3;

    ll ans = 0;
    if(y1 > a)
        ans += y1-a;
    if(y2 > b)
        ans += y2-b;
    printf("%lld",ans);
    return 0;
}