ShahnovskiyLab4(1)

#include <iostream>
#include <ctime>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <list>
using namespace std;
int gl_time = 0;
vector<pair<int, int> > procs; // memory, time
struct proc {
    int begin, size, end_time;
    proc(int begin = 0, int size = 0, int end_time = 0) {
        this->begin = begin;
        this->size = size;
        this->end_time = end_time;
    }
};
vector<proc> ram;
void generate(int n = 65535) {
    for (int i = 0; i < n; i++) {
        procs.push_back(make_pair(rand() % n, rand() % n));
    }
}
//redefine!!!!!!!!!!!!!!!!!!!!!
struct classcomp1 {
  bool operator() (const proc& lhs, const proc& rhs) const {
      return lhs.begin < rhs.begin;
  }
};
struct classcomp2 {
  bool operator() (const proc& lhs, const proc& rhs) const {
      return lhs.end_time < rhs.end_time;
  }
};
struct classcomp3 {
  bool operator() (const proc& lhs, const proc& rhs) const {
      return lhs.end_time < rhs.end_time;
  }
};
set<pair<proc, void*>,classcomp1 > fr_bsegment;
set<pair<proc, void*>,classcomp2 > fr_tsegment;
bool comp1(proc & a, proc & b) {
        return a.end_time < b.end_time;
}
bool comp2(proc & a, proc & b) {
    if (a.size == b.size)
        return a.begin < b.begin;
    return a.size < b.size;
}
void insert(pair<int, int > & a) {
    //new elment
    set<pair<proc, set<proc>::iterator>,classcomp1 >::iterator it = fr_bsegment.lower_bound(make_pair(new proc(a.first, a.second, 0), fr_tsegment.end()), comp2);
    //for (set<pair<proc, void*>,classcomp1 >::iterator it = fr_bsegment.begin(); it != fr_bsegment.end(); ++it) {
        if ((it->first).size >= a.first) {
            proc toInsert((it->first).begin + a.first, a.first,gl_time + a.second);
            ram.push_back(toInsert);
            fr_bsegment.erase(it);
            fr_tsegment.erase(*((set<pair<proc, void *>,classcomp2>::iterator *)(it->second)));
            fr_bsegment.insert(*(new proc((it->first).begin + a.first, (it->first).size - a.second, 0)));
            return ;
        }
    //}
    set<pair<proc, set<proc>::iterator>,classcomp2 >::iterator it1 = fr_tsegment.lower_bound(make_pair(new proc(0, a.first, 0), fr_bsegment.end()), comp1);
    gl_time = it1->first.end_time;
    fr_bsegment.erase(*((set<pair<proc, void *>,classcomp1>::iterator *)(it1->second)));
    insert(a);
    return ;
}
int algo;
int main() {
    cout << "Enter number of you favourite algo:";
    cout << "1 - firstfit";
    cout << "2 - bestfit";
    cin >> algo;
    generate(100);
    for (int i = 0; i < 100; i++) {
        //are we need to delete
        /*for (int j = 0; j < ram.size(); j++) {
            if (ram[j].end_time <= gl_time) {
                ram.erase(ram.begin() + j);
            }
        }*/
        //insert
        insert(procs[i]);
    }
    return 0;
}