A. Greed(水题)
来源:互联网 发布:淘宝美伢抄袭 编辑:程序博客网 时间:2024/06/10 16:43
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.
Output
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).
Examples
input
2
3 5
3 6
output
YES
input
3
6 8 9
6 10 12
output
NO
input
5
0 0 5 0 0
1 1 8 10 5
output
YES
input
4
4 1 0 3
5 2 2 3
output
YES
题解:
注意开long long
计算出总的volume与前两大的capacity进行比较即可
代码:
#include <bits/stdc++.h>using namespace std;const int maxn = 1e5+100;typedef long long LL;struct Cola{ LL volume; LL capacity;};Cola cola[maxn];bool cmp(Cola a,Cola b){ return a.capacity>b.capacity;}int main(){ int n; cin>>n; LL sumV=0; for(int i=0;i<n;i++) { cin>>cola[i].volume; sumV+=cola[i].volume; } for(int i=0;i<n;i++) cin>>cola[i].capacity; sort(cola,cola+n,cmp); LL sumC = cola[0].capacity+cola[1].capacity; if(sumV<=sumC) { cout<<"YES"<<endl; }else { cout<<"NO"<<endl; } return 0;}
- A. Greed(水题)
- A. Greed
- Codeforces 892 A Greed(水题)
- Codeforces 892A. Greed
- Codeforces 892A Greed
- codeforces 892A. Greed
- Codeforces Round #446 (Div. 2) A Greed
- Codeforces Round #446 (Div. 2) A. Greed
- Algorithm:Greed Algorithm
- ZOJ 3607Lazier Salesgirl(greed)
- TopCoder Arena 插件配置(1)Greed 2.0
- 在Greed里自定义自己的模板
- POJ 1784/EOJ 1447 Huffman's Greed 动态规划
- poj 1784 Huffman's Greed 动态规划四边形加速求最优二叉搜索树
- codewars打怪日记 Greed is Good JavaScript中数组用法和 哈希表的使用
- codeforces 667A A. Pouring Rain(水题)
- HDU1229(A+B水题)
- 经典DP水题A
- bigDecimal的精度和四舍五入
- C++plus笔记10
- 各种环境下的编码
- 浏览器加载和渲染html的顺序
- linux学习[查漏补缺]
- A. Greed(水题)
- 重装系统(WIN10)
- How to develop MT5 Gateway API Quote and Trade
- 关于阿里云esc云服务快速配置到mysql的连接
- (转载)关于android:id="@+id/xx"的理解
- 最小点覆盖,最小边覆盖,最大匹配,最小路径覆盖,最大独立集总结。
- vue路由传参
- 百度电子图表js框架(附js软件测试报告demo)
- 唯快不破:Web 应用的 13 个优化步骤