time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
For simplicity, we'll assume that there are only three types of grapes: green grapes, purple grapes and black grapes.
Andrew, Dmitry and Michal are all grapes' lovers, however their preferences of grapes are different. To make all of them happy, the following should happen:
- Andrew, Dmitry and Michal should eat at least xx, yy and zz grapes, respectively.
- Andrew has an extreme affinity for green grapes, thus he will eat green grapes and green grapes only.
- On the other hand, Dmitry is not a fan of black grapes — any types of grapes except black would do for him. In other words, Dmitry can eat green and purple grapes.
- Michal has a common taste — he enjoys grapes in general and will be pleased with any types of grapes, as long as the quantity is sufficient.
Knowing that his friends are so fond of grapes, Aki decided to host a grape party with them. He has prepared a box with aa green grapes, bbpurple grapes and cc black grapes.
However, Aki isn't sure if the box he prepared contains enough grapes to make everyone happy. Can you please find out whether it's possible to distribute grapes so that everyone is happy or Aki has to buy some more grapes?
It is not required to distribute all the grapes, so it's possible that some of them will remain unused.
Input
The first line contains three integers xx, yy and zz (1≤x,y,z≤1051≤x,y,z≤105) — the number of grapes Andrew, Dmitry and Michal want to eat.
The second line contains three integers aa, bb, cc (1≤a,b,c≤1051≤a,b,c≤105) — the number of green, purple and black grapes in the box.
Output
If there is a grape distribution that allows everyone to be happy, print "YES", otherwise print "NO".
Examples
input
Copy
1 6 2 4 3 3
output
Copy
YES
input
Copy
5 1 1 4 3 2
output
Copy
NO
Note
In the first example, there is only one possible distribution:
Andrew should take 11 green grape, Dmitry should take 33 remaining green grapes and 33 purple grapes, and Michal will take 22 out of 33available black grapes.
In the second test, there is no possible distribution, since Andrew is not be able to eat enough green grapes. 
解题说明：模拟题，按照题目意思进行判断即可。
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int a = 0, b = 0, c = 0, x = 0, y = 0, z = 0;
scanf("%d %d %d %d %d %d", &x, &y, &z, &a, &b, &c);
if (x <= a && x + y <= a + b && x + y + z <= a + b + c)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
return 0;
}
转载自原文链接, 如需删除请联系管理员。
原文链接：A. Got Any Grapes?，转载请注明来源！