#include <iostream>
#include <algorithm>
using namespace std;

struct Process {
    int id, burst, waiting, turnaround;
};

bool compare(Process a, Process b) {
    return a.burst < b.burst || (a.burst == b.burst && a.id < b.id);
}

int main() {
    int n;
    cout << "Enter number of processes: ";
    cin >> n;
    Process p[n];

    cout << "Enter burst times:\\n";
    for (int i = 0; i < n; i++) {
        p[i].id = i+1;
        cin >> p[i].burst;
    }

    sort(p, p + n, compare);

    p[0].waiting = 0;
    for (int i = 1; i < n; i++)
        p[i].waiting = p[i - 1].waiting + p[i - 1].burst;

    for (int i = 0; i < n; i++)
        p[i].turnaround = p[i].waiting + p[i].burst;

    cout << "\\nProcess\\tBurst\\tWaiting\\tTurnaround\\n";
    float total_wt = 0, total_tt = 0;
    for (int i = 0; i < n; i++) {
        cout << "P" << p[i].id << "\\t" << p[i].burst << "\\t" << p[i].waiting << "\\t" << p[i].turnaround << "\\n";
        total_wt += p[i].waiting;
        total_tt += p[i].turnaround;
    }
    cout << "Average Waiting Time: " << total_wt / n << "\\n";
    cout << "Average Turnaround Time: " << total_tt / n << "\\n";
    return 0;
}