题解 | 小O的糖果

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int a, b,c;
    int x,k;
    cin >> a >>b>>c;
    cin >> x>>k;
    int maxinit = max({a,b,c});
    int maxnew = x-k+1;
    if(maxinit>maxnew){
        cout <<"YES" << endl;
    }
    else{
        cout <<"NO"<< endl;
    }
    return 0;


    
}
// 64 位输出请用 printf("%lld")