/* Challenge - Plan for Code, Eat and Sleep. The following program accepts a priority list, and then sorts the entered activities according to the given priority list. The program assumes that the priority list is of the order -

  

Sample Input :
2 1 3
code(1)
code(2)
sleep(1)
sleep(2)
eat(2)
eat(1)
doit()

Sample Output :

Eat 2 hours.
Eat 1 hour.
Code 1 hour.
Code 2 hours.
Sleep 1 hour.
Sleep 2 hours.

*/

#include
#include
#include
#include
using namespace std;

/// Global Variables
int pref[3]; vector cdt,slt,ett;
class Activity /// Class to hold activities.
{
    string name; vector Time;
public:
    void Assign(string s,vector v)
    {name=s;Time=v;}
    void Print() 
    { for(int i:Time) { cout< List(3);

/// Converts String to int.
template T Convert(string s)
{ T v; stringstream ss(s); ss>>v; return v; }
/// Processes activity according 
/// to preferences.
void doit()
{ for(Activity a : List) a.Print(); }
int main()
{
    for(int& n:pref){cin>>n;} 
    /// Assign Order of Preference.
    string s,sm; cin.ignore(); 
    /// Record Calls in s.
    while(s!="doit()")
    {
        getline(cin,s);
        {
            sm = s.substr(0,s.find('('));
            if(sm=="code") 
                cdt.push_back(Convert
                (s.substr(s.find('(')+1)));
            else if(sm=="sleep") 
                slt.push_back(Convert
                (s.substr(s.find('(')+1)));
            else if(sm=="eat") 
                ett.push_back(Convert
                (s.substr(s.find('(')+1)));
        }
    }
    List[pref[0]-1].Assign("Code",cdt);
    List[pref[1]-1].Assign("Eat",ett);
    List[pref[2]-1].Assign("Sleep",slt);
    doit();
}

/*

[challenge] code, eat and sleep  - but planned! 💤💤💤💤💻💻🍴🍴🍴

We all know, we cant do all things immediately. We have to plan.

Define three functions(code,eat,sleep) with parameter hours.
Assign a priority to each function.

If you call that functions, they should not be processed immediatly but scheduled.

The call of a further function doit() tells the functions to run as they are scheduled:
Use your own rule for schedule. 
Example:
 Rule: Highest prio first.
Prios:
code():1
eat():2
sleep():3

call code(1)
call sleep(2)
call eat(1)
call code(2)
call eat(2)
call doit()

Output:
code 1 hour
code 2 hours
eat 1 hour
eat 2 hours
sleep 2 hours

choose your own weapon, your own rule, your own prios

Have fun

*/

Challenge - Code,Eat,Sleep Priority