← 返回题目

题库练习 Greed

← 上一题下一题 →

A11414 | $Greed$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Jafar has $n$ cans of cola. Each can is described by two integers: remaining volume of cola $a_{i}$ and can's capacity $b_{i}$ ( $a_{i}$ $<=$ $b_{i}$ ). Jafar has decided to pour all remaining cola into just $2$ cans, determine if he can do this or not!

输入格式

The first line of the input contains one integer $n$ ( $2<=n<=100000$ ) — number of cola cans. The second line contains $n$ space-separated integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ) — volume of remaining cola in cans. The third line contains $n$ space-separated integers that $b_{1},b_{2},...,b_{n}$ ( $a_{i}<=b_{i}<=10^{9}$ ) — capacities of the cans.

输出格式

Print "YES" (without quotes) if it is possible to pour all remaining cola in $2$ cans. Otherwise print "NO" (without quotes). You can print each letter in any case (upper or lower).

输入输出样例

输入 #1

2
3 5
3 6

输出 #1

YES

输入 #2

3
6 8 9
6 10 12

输出 #2

NO

输入 #3

5
0 0 5 0 0
1 1 8 10 5

输出 #3

YES

输入 #4

4
4 1 0 3
5 2 2 3

输出 #4

YES

C++ 编辑器

输入

输出