#include <bits/stdc++.h>

using namespace std;
const int MAX = 1e5;

#define W "waitting"
#define R "running"
#define F "finished"

struct WORK
{
    string work_name; // 作业名
    int serve_time; // 剩余服务时间
    int r_serve_time; // 服务时间
    int arrive_time; // 到达时间
    string work_state; // 作业状态
    int end_time; // 结束时间
    int turnover_time; // 周转时间
};

WORK work[MAX]; // 作业

int n; // 作业数量

bool cmp_SJF(WORK x, WORK y) // 排序函数
{
    if(x.serve_time != y.serve_time) // 服务时间不同时短作业优先
        return x.serve_time < y.serve_time;
    else // 服务时间相同时先来先服务
        return x.arrive_time < y.arrive_time;
}

bool cmp_arr_time(WORK x, WORK y) // 按到达时间从小到大排序
{
    return x.arrive_time < y.arrive_time;
}

int count_work(int t) // 计算某一时间有多少个作业进入
{
    int cnt = 0;
    for(int i = 1; i <= n; i++)
    {
        if(work[i].arrive_time <= t)
            cnt++;
    }
    return cnt;
}

void update_work(int num, int c_time) // 更新当前每个作业的状态
{
    int t = 0;
    for(int i = 1; i <= num; i++)
    {
        if(work[i].serve_time <= 0) // 作业已经结束
        {
            work[i].serve_time = 0;
            work[i].work_state = F;
        }
        else if(work[i].serve_time > 0) // 作业还没结束
        {
            work[i].serve_time --;
            work[i].work_state = R;
            t = i;
            break;
        }
    }

    for(int i = 1; i <= n; i++) // 更新状态
    {
        if(i != t)
        {
            if(work[i].work_state != F)
                work[i].work_state = W;
        }
        if(work[i].work_state == F && work[i].end_time == -1)
            work[i].end_time = c_time;
    }

}

bool judge_over() // 判断作业是否全部完成
{
    for(int i = 1; i <= n; i++)
        if(work[i].work_state != F)
            return false;
    return true;
}

int main()
{
    cout << "请输入要调度的作业：" << endl;
    cout << "要调度的作业的数量：" ;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cout << "作业名： " << endl;
        cin >> work[i].work_name;
        cout << "作业服务时间： " << endl;
        cin >> work[i].serve_time;
        cout << "作业到达时间： " << endl;
        cin >> work[i].arrive_time;
        work[i].work_state = W;
        work[i].end_time = -1;
        work[i].r_serve_time = work[i].serve_time;
    }

    sort(work + 1, work + 1 + n, cmp_arr_time); // 先按到达时间排序

    cout << "作业初始状态：" << endl;
    cout << "    作业名    " << "    到达时间    "
     << "    服务时间    " << "    当前状态    " << endl;
    for(int i = 1; i <= n; i++)
    {
        cout  << setw(8) << work[i].work_name << setw(16)
        << work[i].arrive_time << setw(13) << work[i].serve_time
        << setw(21)  << work[i].work_state << endl;
    }
    cout << endl;

    int arrive_num = 0; // 已到达的作业数量
    int current_time = 0; // 当前时间

    cout << "作业调度情况如下：" << endl;


    bool is_over = false;

    while(!is_over)
    {
        cout << "    时刻    " << "    作业名    " << "    到达时间    "
        << "    剩余服务时间    " << "    当前状态    " << endl;
        arrive_num = count_work(current_time);
        sort(work + 1, work + 1 + arrive_num, cmp_SJF); // 排序

        update_work(arrive_num, current_time);

        for(int i = 1; i <= arrive_num; i++)
        {
            cout  << setw(6) << current_time << setw(13) << work[i].work_name
            << setw(15) << work[i].arrive_time << setw(15) << work[i].serve_time
            << setw(24)  << work[i].work_state << endl;
        }

        current_time ++;
        is_over = judge_over();
        cout << endl;
    }

    cout << "各作业的周转时间和带权周转时间如下：" << endl;
    cout << "    作业名    " << "    周转时间    " << "    带权周转时间    " << endl;
    for(int i = 1; i <= n; i++)
    {
        work[i].turnover_time = work[i].end_time - work[i].arrive_time; // 周转时间
        double wight_time = 1.0 * work[i].turnover_time / work[i].r_serve_time; // 带权周转时间

        cout << setw(6) << work[i].work_name << setw(15) << work[i].turnover_time << setw(18);
        cout.precision(4);
        cout << wight_time << endl;
    }
    return 0;
}