#include #define rep(i,a) for(int i=(int)0;i<(int)a;++i) #define rrep(i,a) for(int i=(int)a-1;i>=0;--i) #define REP(i,a,b) for(int i=(int)a;i<(int)b;++i) #define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i) #define pb push_back #define eb emplace_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() typedef std::vector vi; typedef std::vector> vvi; typedef std::vector vl; typedef std::vector> vvl; #define out(x) cout< inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m!=0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m)*abs(m);//gl=xy } using namespace std; void solve(){ int n,x,y,z; cin>>n>>x>>y>>z; vectora(n); rep(i,n)cin>>a[i],a[i]++; bool ng=false; rep(i,n){ int cul=min(a[i]/10000,z); z-=cul; a[i]-=10000*cul; chmax(a[i],0); } if(z>0){ sort(rall(a)); rep(i,n){ int cul=min((a[i]+9999)/10000,z); z-=cul; a[i]-=10000*cul; chmax(a[i],0); } } rep(i,n){ int cul=min(a[i]/5000,y); y-=cul; a[i]-=5000*cul; chmax(a[i],0); } if(y>0){ sort(rall(a)); rep(i,n){ int cul=min((a[i]+4999)/5000,y); y-=cul; a[i]-=5000*cul; chmax(a[i],0); } } rep(i,n){ int cul=min(a[i]/1000,x); x-=cul; a[i]-=1000*cul; chmax(a[i],0); } if(x>0){ sort(rall(a)); rep(i,n){ int cul=min((a[i]+999)/1000,x); x-=cul; a[i]-=1000*cul; chmax(a[i],0); } } rep(i,n){ if(a[i]>0)ng=true; } if(!ng)cout<<"Yes\n"; else cout<<"No\n"; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout<