302325: CF448A. Rewards

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Rewards

题意翻译

Bizon 有 $a_1$ 个一等奖奖杯,$a_2$ 个二等奖奖杯,$a_3$ 个三等奖奖杯,$b_1$ 个一等奖奖章,$b_2$ 个二等奖奖章,$b_3$ 个三等奖奖章和 $n$ 个柜子。 每个柜子可以放小于等于 $5$ 个奖杯或小于等于 $10$ 个奖章。奖杯和奖章不能放在一个柜子中。问这 $n$ 个柜子能不能放下这些奖杯和奖章。如果能,输出`YES`;如果不能,输出`NO`。

题目描述

Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a new glass cupboard with $ n $ shelves and he decided to put all his presents there. All the presents can be divided into two types: medals and cups. Bizon the Champion has $ a_{1} $ first prize cups, $ a_{2} $ second prize cups and $ a_{3} $ third prize cups. Besides, he has $ b_{1} $ first prize medals, $ b_{2} $ second prize medals and $ b_{3} $ third prize medals. Naturally, the rewards in the cupboard must look good, that's why Bizon the Champion decided to follow the rules: - any shelf cannot contain both cups and medals at the same time; - no shelf can contain more than five cups; - no shelf can have more than ten medals. Help Bizon the Champion find out if we can put all the rewards so that all the conditions are fulfilled.

输入输出格式

输入格式


The first line contains integers $ a_{1} $ , $ a_{2} $ and $ a_{3} $ $ (0<=a_{1},a_{2},a_{3}<=100) $ . The second line contains integers $ b_{1} $ , $ b_{2} $ and $ b_{3} $ $ (0<=b_{1},b_{2},b_{3}<=100) $ . The third line contains integer $ n $ $ (1<=n<=100) $ . The numbers in the lines are separated by single spaces.

输出格式


Print "YES" (without the quotes) if all the rewards can be put on the shelves in the described manner. Otherwise, print "NO" (without the quotes).

输入输出样例

输入样例 #1

1 1 1
1 1 1
4

输出样例 #1

YES

输入样例 #2

1 1 3
2 3 4
2

输出样例 #2

YES

输入样例 #3

1 0 0
1 0 0
1

输出样例 #3

NO

Input

题意翻译

Bizon 有 $a_1$ 个一等奖奖杯,$a_2$ 个二等奖奖杯,$a_3$ 个三等奖奖杯,$b_1$ 个一等奖奖章,$b_2$ 个二等奖奖章,$b_3$ 个三等奖奖章和 $n$ 个柜子。 每个柜子可以放小于等于 $5$ 个奖杯或小于等于 $10$ 个奖章。奖杯和奖章不能放在一个柜子中。问这 $n$ 个柜子能不能放下这些奖杯和奖章。如果能,输出`YES`;如果不能,输出`NO`。

加入题单

算法标签: