Codeforces 892 A.Greed
2017-11-18 22:51
281 查看
A. Greed
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
output
input
output
input
output
input
output
Note
In the first sample, there are already 2 cans, so the answer is "YES".
分析:签到题,排个序看容量最大的杯子能否装下.
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
Note
In the first sample, there are already 2 cans, so the answer is "YES".
分析:签到题,排个序看容量最大的杯子能否装下.
#include <cstdio> #include <cmath> #include <queue> #include <cstring> #include <iostream> #include <algorithm> using namespace std; long long n, a[100010], b[100010], sum; int main() { cin >> n; for (int i = 1; i <= n; i++) { long long t; cin >> t; sum += t; } for (int i = 1; i <= n; i++) cin >> b[i]; sort(b + 1, b + 1 + n); if (sum <= b + b[n - 1]) puts("YES"); else puts("NO"); return 0; }
相关文章推荐
- Codeforces 892 A Greed(水题)
- codeforces 892 A题 Greed
- Codeforces 892 B. Wrath
- Codeforces 892 C. Pride
- Codeforces 892 B.Wrath
- Codeforces 892 C.Pride
- Codeforces 892 D.Gluttony
- Codeforces 892 D. Gluttony (思维)
- Codeforces 892 B. Wrath (递推)div2
- Codeforces 892 C. Pride (枚举)
- Codeforces 892 B. Wrath (递推)
- CodeForces - 892 C - Pride【GCD思维】
- CodeForces - 892 B C D
- codeforces 892 B题 Wrath
- Codeforces 892/E Envy 最小生成树的query
- codeforces 796C
- 【codeforces 508B】Anton and currency you all know
- CodeForces - 675B Restoring Painting (暴力&转换)水
- 【 CodeForces 208A】Dubstep
- Codeforces 489E Hiking(普通01分数规划加DP)