I'll give a thumbs up !! Can anyone make this code more like :

Day 0 staff 0 does not work staff 1 works staff 2 works staff 3 works Day 1 staff 0 works staff 1 does not work staff 2 works staff 3 works Day 2 staff 0 works staff 1 works staff 2 works staff 3 does not work THE CODE: #include  #include  using namespace std; int main() { int m,n,k; cout<<"Enter m , n & k:"<>m>>n>>k; queue working,onLeave; cout<<"Enter staff Requirement: "<>a[i]; } int output[n]; for(int i=0;i 
Implement an automatic shifts arrangement system. Problem description: Given m staffs and n days, find an arrangement that can satisfy (1) each staff must take at least k days off; (2) given that each day requires at least ai(1<=i<=n) staffs for working, the arrangement on each day should have more than ai staffs (when possible). Design the data structure and algorithm and analyze their complexity in the report, and note that the experiment analysis for different input size is needed. C++ language