Urn with Balls

C. Urn with Balls
time limit per test
2.0 s
memory limit per test
256 MB
input
standard input
output
standard output

Megabrain has usual problems with the occupiers: he is captured again and is forced to solve logical puzzles about urns with balls. In the urn staying in front of Megabrain there are a red balls, b green balls and also c balls, colors of which are unknown to Megabrain. The occupiers demand an answer to a question: what is the maximal number of balls one can take out of this urn, so that there would be no more than n red and no more than m green balls among them for sure?

Input

The first line contains three integers ab and c separated by a space (0 ≤ a, b, c ≤ 109) — the number of red balls in the urn, the number of green balls in the urn, and the number of balls of unknown color in the urn, correspondingly.

The second line contains two integers n and m separated by a space (0 ≤ n, m ≤ 109) — the maximal number of red balls allowed to be taken out of the urn and the maximal number of green balls allowed to be taken out of the urn, correspondingly.

Output

Output a single integer — the maximal number of balls that can be taken out of the urn so that no restrictions are violated.

Examples
input
Copy
3 2 9
2 7
output
Copy
2
input
Copy
1 2 4
8 4
output
Copy
4

题意:给出 n 个 红球 m个蓝球,k个未知颜色的球。问最多取出几个球才能使取出的球中红球数量不超过 q ,蓝球数量不超过 p。

思路:

         假设 k 个球都是红球或蓝球即可。

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

long long a,b,c;
long long n, m;

int main()
{
    scanf("%d%d%d",&a,&b,&c);
    scanf("%d%d",&n,&m);

    long long ans = a+b+c;

    if(a+c>n) {
        ans = n;
    }
    if(b+c>m) {
        ans = min(ans,m);
    }
    printf("%lld\n",ans);

    return 0;
}

 



转载于:https://www.cnblogs.com/yiyunwang/p/9427247.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值