请写一个显示平均带权时间的高响应比优先调度算法程序

以下是一个示例程序，用于实现高响应比优先调度算法并计算平均带权时间：

#include <iostream>
#include <vector>
#include <algorithm>

struct Process {
    int id;
    int arrival_time;
    int burst_time;
    int waiting_time;
    int turnaround_time;
};

bool compare(Process p1, Process p2) {
    return (p1.arrival_time < p2.arrival_time);
}

void calculateWaitingTime(std::vector<Process>& processes) {
    int n = processes.size();
    int total_waiting_time = 0, total_turnaround_time = 0;
    std::vector<int> burst_times(n);

    for (int i = 0; i < n; i++) {
        burst_times[i] = processes[i].burst_time;
    }

    int current_time = 0;
    while (true) {
        bool done = true;
        int highest_response_ratio = -1, selected_process = -1;

        for (int i = 0; i < n; i++) {
            if (processes[i].arrival_time <= current_time && burst_times[i] > 0) {
                int response_ratio = 1 + (current_time - processes[i].arrival_time) / burst_times[i];
                if (response_ratio > highest_response_ratio) {
                    highest_response_ratio = response_ratio;
                    selected_process = i;
                }
                done = false;
            }
        }

        if (done) break;

        burst_times[selected_process]--;
        current_time++;

        if (burst_times[selected_process] == 0) {
            processes[selected_process].turnaround_time = current_time - processes[selected_process].arrival_time;
            processes[selected_process].waiting_time = processes[selected_process].turnaround_time - processes[selected_process].burst_time;
            total_waiting_time += processes[selected_process].waiting_time;
            total_turnaround_time += processes[selected_process].turnaround_time;
        }
    }

    std::cout << "Average waiting time = " << (float)total_waiting_time / n << std::endl;
    std::cout << "Average turnaround time = " << (float)total_turnaround_time / n << std::endl;
}

int main() {
    std::vector<Process> processes = {
        {1, 0, 5},
        {2, 1, 3},
        {3, 2, 8},
        {4, 3, 6}
    };

    std::sort(processes.begin(), processes.end(), compare);

    calculateWaitingTime(processes);

    return 0;
}

这个程序首先定义了一个 `Process` 结构体，用于存储进程的相关信息。然后定义了一个 `compare` 函数，用于在调度算法中按照到达时间排序进程。接着定义了一个 `calculateWaitingTime` 函数，该函数实现了高响应比优先调度算法并计算平均带权时间。最后在 `main` 函数中定义了一些进程，按照到达时间排序后调用 `calculateWaitingTime` 函数来计算平均带权时间。