linux c 最短剩余时间

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    int pid;             // 进程ID
    int burst_time;      // 总执行时间
    int remaining_time;  // 剩余执行时间
} Process;

// 比较函数，用于qsort排序
int compare(const void *a, const void *b) {
    Process *p1 = (Process *)a;
    Process *p2 = (Process *)b;
    return p1->remaining_time - p2->remaining_time;
}

void schedule(Process processes[], int n) {
    int total_time = 0;
    printf("Process ID\tBurst Time\tRemaining Time\n");

    while (1) {
        int shortest = -1;
        for (int i = 0; i < n; i++) {
            if (processes[i].remaining_time > 0) {
                if (shortest == -1 || processes[i].remaining_time < processes[shortest].remaining_time) {
                    shortest = i;
                }
            }
        }

        if (shortest == -1) break;

        processes[shortest].remaining_time--;
        total_time++;

        printf("P%d\t\t%d\t\t%d\n", processes[shortest].pid, processes[shortest].burst_time, processes[shortest].remaining_time);
    }

    printf("Total time: %d\n", total_time);
}

int main() {
    Process processes[] = {
        {1, 6, 6},
        {2, 8, 8},
        {3, 7, 7}
    };
    int n = sizeof(processes) / sizeof(processes[0]);

    schedule(processes, n);

    return 0;
}