最坏适应算法的实现c++

最坏适应算法（Worst-Fit Algorithm）是一种内存分配算法，它选择可用空间中最大的块来分配给请求的内存。下面是一个简单的C++实现：

#include <iostream>
using namespace std;

const int MAX = 100;

int main() {
    int n, m, i, j, temp;
    int memory[MAX], process[MAX];
    bool allocated[MAX];

    cout << "Enter the number of memory blocks: ";
    cin >> n;

    cout << "Enter the size of each memory block: ";
    for (i = 0; i < n; i++) {
        cin >> memory[i];
        allocated[i] = false;
    }

    cout << "Enter the number of processes: ";
    cin >> m;

    cout << "Enter the size of each process: ";
    for (i = 0; i < m; i++) {
        cin >> process[i];
    }

    for (i = 0; i < m; i++) {
        temp = -1;
        for (j = 0; j < n; j++) {
            if (!allocated[j] && memory[j] >= process[i]) {
                if (temp == -1 || memory[j] > memory[temp]) {
                    temp = j;
                }
            }
        }
        if (temp != -1) {
            allocated[temp] = true;
            cout << "Process " << i+1 << " allocated to Memory Block " << temp+1 << endl;
        } else {
            cout << "Process " << i+1 << " can't be allocated" << endl;
        }
    }

    return 0;
}

该程序首先请求用户输入内存块和进程的数量和大小，然后使用最坏适应算法来分配内存。它使用一个名为`allocated`的布尔数组来跟踪哪些内存块已经被分配。如果找到一个合适的内存块，则将其标记为已分配，并输出分配的信息。如果没有找到合适的内存块，则输出无法分配的信息。