#include<bits/stdc++.h>
using namespace std;
//for holding process info
struct Process{
    int id,a_t,b_t,initial_b_t,c_t,t_t,w_t,index;
};
//for sorting process according to arrival time
bool compare(Process x,Process y){
    if(x.a_t==y.a_t)return x.id<y.id;
    return x.a_t<y.a_t;
}

//for sorting process according to id
bool compareid(Process x,Process y){
    return x.id<y.id;
}
int main()
{
    int n, timequantum;
    cin>>n;
    Process p[n+1];
    int a[n+1],b[n+1];
    // Input stuff
    for(int i=0; i<n; i++)cin>>a[i];
    for(int i=0; i<n; i++)cin>>b[i];
    cout<<"Enter the time quantum :"; cin>>timequantum;
    for(int i=0; i<n; i++){
        p[i].id=i+1;
        p[i].a_t=a[i];
        p[i].b_t=b[i];
        p[i].initial_b_t=b[i];
    }
    //sort as arrival time
    sort(p,p+n,compare);
    for(int i=0; i<n; i++)p[i].index=i;// saving the index.

    queue <Process> pq;
    int time=0,it=0;

    while(it<n){
        if(pq.empty()){
            // if no process available we increase the time to the next process A_T
            if(time<p[it].a_t)time=p[it].a_t;
        }
        // Pushing the Process that are ready in the priority queue
        while(p[it].a_t<=time){
            pq.push(p[it]);
            it++;
        }
        // picking front one from the queue.
        Process curr=pq.front();
        pq.pop();
        int pos=curr.index;

        if( p[pos].b_t>timequantum){
            p[pos].b_t-=timequantum;
            time+=timequantum;
            pq.push(p[pos]);
        }
        else{
            if( p[pos].b_t==timequantum){
                time+=timequantum;
            }
            else{
                time+=p[pos].b_t;
            }
            p[pos].c_t=time;
            p[pos].t_t=time- p[pos].a_t;
            p[pos].w_t=p[pos].t_t- p[pos].initial_b_t;
        }

    }
    // now all the process is in the queue. and we will just calculate them.
    while(!pq.empty()){
       Process curr=pq.front();
        pq.pop();
        int pos=curr.index;

        if( p[pos].b_t>timequantum){
            p[pos].b_t-=timequantum;
            time+=timequantum;
            pq.push(p[pos]);
        }
        else{
            if( p[pos].b_t==timequantum){
                time+=timequantum;
            }
            else{
                time+=p[pos].b_t;
            }
            p[pos].c_t=time;
            p[pos].t_t=time- p[pos].a_t;
            p[pos].w_t=p[pos].t_t- p[pos].initial_b_t;
        }
    }


    //Sorting as the id for printing purpose
    sort(p,p+n,compareid);
    double avgWaiting=0;

    //Printing in a table format
    for(int j=0; j<100; j++)cout<<'-';
        cout<<"\n| process ID | Arrival_Time | Burst_Time | Completion_Time | Turnaround_Time | Waiting_Time |\n";
    for(int i=0; i<n; i++){
        for(int j=0; j<100; j++)cout<<'-';
        cout<<"\n|      P"<<p[i].id<<"    ";
        cout<<"|      "<<p[i].a_t<<"      ";
        cout<<"|      "<<p[i].initial_b_t<<"      ";
        cout<<"|      "<<p[i].c_t<<"         ";
        cout<<"|      "<<p[i].t_t<<"         ";
        cout<<"|      "<<p[i].w_t<<"      |\n";
        avgWaiting+=p[i].w_t;
    }
    for(int j=0; j<100; j++)cout<<'-';
    cout<<"\n\nAvarage Waiting time: "<<avgWaiting/n<<endl;
    return 0;
}

/*

5
2 5 1 0 4
6 2 8 3 4

*/