Greed

题引

Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can's capacity bi (ai  ≤  bi).Jafar has decided to pour all remaining cola into just 2 cans, determine if he can do this or not!

input

The first line of the input contains one integer n (2 ≤ n ≤ 100 000) — number of cola cans.
The second line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 109) — volume of remaining cola in cans.

The third line contains n space-separated integers that b1, b2, ..., bn (ai ≤ bi ≤ 109) — capacities of the cans.

print

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)

Example：

input  2

           3 5

           3 6

print YES

#######################################################################################

是一个将剩余的可乐是否可以倒入两个杯子的问题，先将杯子最大容量和次大容量求出，如果剩余的可乐体积小于这两个杯子的容量，则可以，即“ YES”，否则则“ NO”。

寻找最大杯子容量，可以先定义max=0，然后用for循环，遍历每一个杯子的容量寻找最大值

寻找此大杯子容量，用同种方法，但是寻找到杯子容量的索引不能等于最大值的索引

		long long int l;	
		for(int i=0;i<n;i++){
			if(max<b[i]){
				max=b[i];
				l = i;
			}		
		}
		for(int i=0;i<n;i++){
			if(max1<b[i]&&i!=l){
				max1=b[i];
			}		
		}

注意：本题，因为n<=100000,将其加和后，用int容易报错，所有要用long long类型

完整代码：

#include <stdio.h>
long long int a[100001];
long long int b[100001];
int main()
{
	long long int n,sum,max;
	while(~scanf("%lld",&n)){
		max=0;
		long long int sum1=0;
		long long int max1=0;
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&a[i]);	
			sum1+=a[i];
		}
		
		for(int i=0;i<n;i++)
			scanf("%lld",&b[i]);
		long long int l;	
		for(int i=0;i<n;i++){
			if(max<b[i]){
				max=b[i];
				l = i;
			}		
		}
		for(int i=0;i<n;i++){
			if(max1<b[i]&&i!=l){
				max1=b[i];
			}		
		}
		sum=max+max1;
		if(sum1<=sum)
			printf("YES\n");
		else
			printf("NO\n");		
	}

}