//First Come First Serve - CPU Scheduling Algorithm
#include<iostream>
#include<vector>
using namespace std;
 
struct Process {
    int process_number;
    int arrival_time;
    int burst_time;
    int completion_time;
    int waiting_time;
    int turn_around_time;
 
    Process(int _process_number, int _arrival_time, int _burst_time) {
        process_number = _process_number;
        arrival_time = _arrival_time;
        burst_time = _burst_time;
    }
};
 
int main() {
    cout << "Enter the number of processes: ";
    int total_processes;
    cin >> total_processes;
 
    vector<Process> processes;
    for(int i = 1;i <= total_processes;i++) {
        int arrival_time, burst_time;
        cin >> arrival_time >> burst_time;
        Process process(i, arrival_time, burst_time);
        processes.push_back(process);
    }
 
    int current_time = 0;
    for(auto &process : processes) {
        process.completion_time = current_time + process.burst_time;
        process.turn_around_time = process.completion_time - process.arrival_time;
        process.waiting_time = process.turn_around_time - process.burst_time;
        current_time = process.completion_time;
    }
 
    for(auto process : processes) {
        cout << "Process Number  : " << process.process_number << endl;
        cout << "Arrival Time    : " << process.arrival_time << endl;
        cout << "Burst Time      : " << process.burst_time<< endl;
        cout << "Completion Time : " << process.completion_time << endl;
        cout << "Waiting Time    : " << process.waiting_time << endl;
        cout << "Turn around TIme: " << process.turn_around_time << endl;
        cout << endl;
    }
 
    return 0;
}

Ly9GaXJzdCBDb21lIEZpcnN0IFNlcnZlIC0gQ1BVIFNjaGVkdWxpbmcgQWxnb3JpdGhtCiNpbmNsdWRlPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgpzdHJ1Y3QgUHJvY2VzcyB7CiAgICBpbnQgcHJvY2Vzc19udW1iZXI7CiAgICBpbnQgYXJyaXZhbF90aW1lOwogICAgaW50IGJ1cnN0X3RpbWU7CiAgICBpbnQgY29tcGxldGlvbl90aW1lOwogICAgaW50IHdhaXRpbmdfdGltZTsKICAgIGludCB0dXJuX2Fyb3VuZF90aW1lOwoKICAgIFByb2Nlc3MoaW50IF9wcm9jZXNzX251bWJlciwgaW50IF9hcnJpdmFsX3RpbWUsIGludCBfYnVyc3RfdGltZSkgewogICAgICAgIHByb2Nlc3NfbnVtYmVyID0gX3Byb2Nlc3NfbnVtYmVyOwogICAgICAgIGFycml2YWxfdGltZSA9IF9hcnJpdmFsX3RpbWU7CiAgICAgICAgYnVyc3RfdGltZSA9IF9idXJzdF90aW1lOwogICAgfQp9OwoKaW50IG1haW4oKSB7CiAgICBjb3V0IDw8ICJFbnRlciB0aGUgbnVtYmVyIG9mIHByb2Nlc3NlczogIjsKICAgIGludCB0b3RhbF9wcm9jZXNzZXM7CiAgICBjaW4gPj4gdG90YWxfcHJvY2Vzc2VzOwogICAgCiAgICB2ZWN0b3I8UHJvY2Vzcz4gcHJvY2Vzc2VzOwogICAgZm9yKGludCBpID0gMTtpIDw9IHRvdGFsX3Byb2Nlc3NlcztpKyspIHsKICAgICAgICBpbnQgYXJyaXZhbF90aW1lLCBidXJzdF90aW1lOwogICAgICAgIGNpbiA+PiBhcnJpdmFsX3RpbWUgPj4gYnVyc3RfdGltZTsKICAgICAgICBQcm9jZXNzIHByb2Nlc3MoaSwgYXJyaXZhbF90aW1lLCBidXJzdF90aW1lKTsKICAgICAgICBwcm9jZXNzZXMucHVzaF9iYWNrKHByb2Nlc3MpOwogICAgfQoKICAgIGludCBjdXJyZW50X3RpbWUgPSAwOwogICAgZm9yKGF1dG8gJnByb2Nlc3MgOiBwcm9jZXNzZXMpIHsKICAgICAgICBwcm9jZXNzLmNvbXBsZXRpb25fdGltZSA9IGN1cnJlbnRfdGltZSArIHByb2Nlc3MuYnVyc3RfdGltZTsKICAgICAgICBwcm9jZXNzLnR1cm5fYXJvdW5kX3RpbWUgPSBwcm9jZXNzLmNvbXBsZXRpb25fdGltZSAtIHByb2Nlc3MuYXJyaXZhbF90aW1lOwogICAgICAgIHByb2Nlc3Mud2FpdGluZ190aW1lID0gcHJvY2Vzcy50dXJuX2Fyb3VuZF90aW1lIC0gcHJvY2Vzcy5idXJzdF90aW1lOwogICAgICAgIGN1cnJlbnRfdGltZSA9IHByb2Nlc3MuY29tcGxldGlvbl90aW1lOwogICAgfQoKICAgIGZvcihhdXRvIHByb2Nlc3MgOiBwcm9jZXNzZXMpIHsKICAgICAgICBjb3V0IDw8ICJQcm9jZXNzIE51bWJlciAgOiAiIDw8IHByb2Nlc3MucHJvY2Vzc19udW1iZXIgPDwgZW5kbDsKICAgICAgICBjb3V0IDw8ICJBcnJpdmFsIFRpbWUgICAgOiAiIDw8IHByb2Nlc3MuYXJyaXZhbF90aW1lIDw8IGVuZGw7CiAgICAgICAgY291dCA8PCAiQnVyc3QgVGltZSAgICAgIDogIiA8PCBwcm9jZXNzLmJ1cnN0X3RpbWU8PCBlbmRsOwogICAgICAgIGNvdXQgPDwgIkNvbXBsZXRpb24gVGltZSA6ICIgPDwgcHJvY2Vzcy5jb21wbGV0aW9uX3RpbWUgPDwgZW5kbDsKICAgICAgICBjb3V0IDw8ICJXYWl0aW5nIFRpbWUgICAgOiAiIDw8IHByb2Nlc3Mud2FpdGluZ190aW1lIDw8IGVuZGw7CiAgICAgICAgY291dCA8PCAiVHVybiBhcm91bmQgVEltZTogIiA8PCBwcm9jZXNzLnR1cm5fYXJvdW5kX3RpbWUgPDwgZW5kbDsKICAgICAgICBjb3V0IDw8IGVuZGw7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0=