leetcode 860. Lemonade Change

class Solution {
public:
    bool lemonadeChange(vector<int>& bills) {
        int l = bills.size();
        if(l==0)return true;
        if(bills[0]>5)return false;
        int remian[2] = {0};
        for(int i=0;i<l;i++)
        {
            if(bills[i]==5)remian[0]+=1;
            else if(bills[i]==10)
            {
                if(remian[0]<1)return false;
                else
                {
                    remian[0]--;
                    remian[1]++;
                }
            }
            else
            {
                if(remian[1]>=1){
                    if(remian[0]>=1)
                    { 
                        remian[0]-=1;
                        remian[1]-=1;
                   }
                    else return false;
                }
                else if(remian[1]==0)
                {
                    if(remian[0]<3)return false;
                    else
                    {
                        remian[0]-=3;                      
                    }
                 }
                else
                {
                    if(remian[0]<4)return false;
                    else remian[0]-=4;
                 }
            }
        }
        return true;
    }
    
};