如何在C中将队列中的最小元素出队

#include <stdio.h>

#define MAX_QUEUE_SIZE 100

typedef struct {
    int data[MAX_QUEUE_SIZE];
    int front;
    int rear;
} Queue;

// 初始化队列
void initQueue(Queue* queue) {
    queue->front = 0;
    queue->rear = 0;
}

// 判断队列是否为空
int isEmpty(Queue* queue) {
    return queue->front == queue->rear;
}

// 判断队列是否已满
int isFull(Queue* queue) {
    return (queue->rear + 1) % MAX_QUEUE_SIZE == queue->front;
}

// 入队操作
void enqueue(Queue* queue, int element) {
    if (isFull(queue)) {
        printf("Queue is full.\n");
        return;
    }
    queue->data[queue->rear] = element;
    queue->rear = (queue->rear + 1) % MAX_QUEUE_SIZE;
}

// 出队操作
int dequeue(Queue* queue) {
    if (isEmpty(queue)) {
        printf("Queue is empty.\n");
        return -1; // 返回一个特殊值表示出错
    }
    int element = queue->data[queue->front];
    queue->front = (queue->front + 1) % MAX_QUEUE_SIZE;
    return element;
}

// 查找队列中的最小元素并出队
int dequeueMin(Queue* queue) {
    if (isEmpty(queue)) {
        printf("Queue is empty.\n");
        return -1; // 返回一个特殊值表示出错
    }
    int minElement = queue->data[queue->front];
    int minIndex = queue->front;

    // 在队列中找到最小元素及其位置
    for (int i = queue->front; i != queue->rear; i = (i + 1) % MAX_QUEUE_SIZE) {
        if (queue->data[i] < minElement) {
            minElement = queue->data[i];
            minIndex = i;
        }
    }

    // 将最小元素出队
    for (int i = minIndex; i != queue->rear; i = (i + 1) % MAX_QUEUE_SIZE) {
        queue->data[i] = queue->data[(i + 1) % MAX_QUEUE_SIZE];
    }
    queue->rear = (queue->rear - 1 + MAX_QUEUE_SIZE) % MAX_QUEUE_SIZE;

    return minElement;
}

int main() {
    Queue queue;
    initQueue(&queue);

    enqueue(&queue, 4);
    enqueue(&queue, 2);
    enqueue(&queue, 5);
    enqueue(&queue, 1);
    enqueue(&queue, 3);

    int minElement = dequeueMin(&queue);
    printf("The smallest element dequeued: %d\n", minElement);

    return 0;
}