页面置换算法LRU

#include <iostream>
#include <string>
using namespace std;

typedef struct page{
    int num;//page number
    int time;//the time which page stay
}Page;
int queue[100];/*record the absolete page*/
int K;
/*init the ram*/
void init(Page *b,int n) {
    for(int i = 0;i < n;i++) {
        b[i].num = -1;
        b[i].time = -1;
    }
}

/*get the page which is the longest in ram,By default the page is the first time called in*/
int getMax(Page *b,int m) {
    int i;
    int max = -1;
    int tag = 0;
    for(i = 0;i < m;i++) {
        if(b[i].time > max) {
            max = b[i].time;
            tag = i;
        }
    }
    return tag;
}

/*judge whether the page was in ram*/
int equation(int fold,Page *b,int m) {
    int i;
    for(i = 0;i < m;i++) {
        if(fold == b[i].num)
            return i;
    }
    cout<<"×××";//中断标记
    return -1;
}

void